DOI-archived release · 12
Part II — Discrete Wave-Constrained Computation and Classical Complexity: Turing Equivalence for P and NP
Canonical provenance
Richard J. Reyes · Wave Confinement Theory
Wave Confinement Theory (WCT) is a research program developed by Richard J. Reyes beginning in 2025. This page documents Part II — Discrete Wave-Constrained Computation and Classical Complexity: Turing Equivalence for P and NP, listed in the research chronology as , with canonical citation DOI 10.5281/zenodo.17732642 and source repository geometry_of_resonance. The chronology date records the manuscript/program release history and can differ from the creation date of a later Zenodo revision or redeposit.
- Researcher
- Richard J. Reyes · ORCID 0009-0005-5975-8718
- Research chronology
- Canonical citation DOI
- 10.5281/zenodo.17732642
- Zenodo record
- https://zenodo.org/records/17732642
- Source repository
- https://github.com/rickyjreyes/geometry_of_resonance
Abstract
This work defines a discrete wave-constrained computation model and studies its relation to classical Turing computation. It focuses on encoding, simulation, and equivalence conditions for the classical P and NP classes under the stated discrete model.
Plain-language overview
Research question
How does a discrete wave-constrained computation model relate to classical Turing computation for the P and NP classes?
Main contribution
- Defines a discrete wave-constrained computation model.
- Studies encoding, simulation, and equivalence conditions relative to classical Turing computation for P and NP.
Evidence type
Current limitations
Equivalence results hold under the stated discrete model and its encoding assumptions.
Research assets
- Read & download
- Zenodo record (manuscript and files)
- Research program hub
- geometry_of_resonance — equations, manuscripts, and simulations
Related works
Verification and traceability
This section is generated from the canonical publication traceability registry. Empty fields are reported rather than inferred.
- Claim IDs
- Equation IDs
- SymPy audit
- Lean coverage
- Assumptions
- Formalization
- OPEN
- Empirical state
- MODEL_RELATIVE
- Independent replication
- NONE_RECORDED
- Repositories
Explicit falsifiers
- The stated encoding or simulation incurs super-polynomial overhead under the declared precision model.
Open obligations
- Formalize the machine model, encoding, precision, update cost, and bidirectional simulation theorems.
Recommended citation
Reyes, R. J. (November 26, 2025). Part II — Discrete Wave-Constrained Computation and Classical Complexity: Turing Equivalence for P and NP. Zenodo. https://doi.org/10.5281/zenodo.17732642
Citation copied to clipboard.
Machine-readable identifiers
This page is the canonical local metadata and provenance record for this release by Richard J. Reyes. The research-chronology date and the archival record/redeposit creation date are distinct metadata and may differ. Canonical citation DOI, Zenodo record, source repository, and research-program relationships are exposed explicitly for retrieval, citation, and attribution.