Submitted:
23 May 2025
Posted:
26 May 2025
Read the latest preprint version here
Abstract
Keywords:
1. Introduction
1.1. Key Claim
1.2. Ontology
2. Framework
3. Methods
3.1. Mathematical vs. Computational Hierarchies
3.2. The Physical Nonexistence of Infinitesimal, Irrational and Imaginary Numbers
3.3. Binary Computation in Classical and Quantum Domains
3.4. Historical Precedents for Integer-Based Systems
3.5. Implications for Physical Theories and AI
3.6. Nature Has No Continuity or Imaginary Measurement
3.7. New Model
3.7.1. Rational State Space
3.7.2. Deterministic Measurement and Eigenvalues
3.7.3. Improved Shor’s Algorithm (ISA)
- Select a random integer a such that gcd(a,N)=1.
- Calculate ax mod N over a rational finite space.
- Apply a rational Fourier-like transform over Zq to extract the period r.
- Use continued fractions (entirely rational) to estimate r.
- Determine nontrivial factors via gcd(ar/2 +/- 1, N).
4. Results
- Computation of 2x mod 15 showed periodicity of 4.
- Rational Fourier-like transform identified the dominant rational frequency component.
- Continued fraction approximation yielded r=4.
- gcd(22 - 1, 15)=3, and gcd(22 +1, 15)=5.
- A rational, deterministic model preserves the algorithmic integrity of quantum computing.
- This aligns with digital logic and cryptographic precision.
- It removes reliance on non-physical constructs like e>0, continuity, or infinite precision.
5. Conclusions
6. Forward
Funding
Acknowledgments
Appendix I. Unifying Framework: The Set Q
The Curry-Howard relationship defines structural logic, quantum information that is discrete ontically, and this sidesteps Gödel’s incompleteness theorems (stated before the Curry-Howard relationship) by using consistent formal systems capable of expressing basic arithmetic with sets R, C and Q, so that there exist no true mathematical statements that cannot be proven within a system. Further, by using sets R, C and Q, any consistent formal system can prove its own consistency, e.g., 1=1, 0=0, and 0≠1. This is tangential to this Appendix and will be mathematically considered elsewhere.
- Paradigm Shift: We propose a paradigm shift from continuous to discrete foundations in physics, aligning with quantum gravity approaches that posit discrete spacetime.
- Mathematical vs. Physical: We distinguish mathematical tools (R/C) from physical reality (Q/B). We negate the ontological status of supposedly continuous quantities (R/C).
- Technical Feasibility: While discrete QC was experimentally demonstrated in 1982 and theoretically confirmed in 2023 cf. [1], practical implementations (with persistent error issues of correction, scalability) remain in use. The efficiency of discrete vs. continuous models needs no more empirical comparison but just to overcome bias.
Appendix II. Differentiation of Discontinuous Functions
- discontinuous at every point, and
- differentiable at every point.
References
- Gerck, E. (1982). Solution of the Schrödinger Equation for Bound States in Closed Form. Physical Review A, 26, 662. Free author copy at https://www.researchgate.net/publication/236420748/. Accessed April 20, 2025. [CrossRef]
- Gerck, E. (1983). Scaling Laws for Rydberg Atoms in Magnetic Fields. Physical Review Letters, 50, 524. Free author copy at https://www.researchgate.net/publication/243470610/. Accessed April 20, 2025. [CrossRef]
- Gerck, E. (2023). Algorithms for Quantum Computation: The Derivatives of Discontinuous Functions. Mathematics, 11(1), 68. Free author copy at https://www.researchgate.net/publication/366577895/. Accessed April 20, 2025. [CrossRef]
- Gerck, E. (2025). RSA-2048 Today and Quantum Computing. Retrieved from https://www.researchgate.net/publication/374155658/. Accessed April 20, 2025.
- Historical studies on the Mayan calendar, Mādhava calculus in India, and the Antikythera mechanism. (Various sources).
- Gerck, E. (2021). Tri-State+ Communication Symmetry Using the Algebraic Approach. Computational Nanotechnology, 8(3), 29–35. Free author copy at https://www.researchgate.net/publication/355406882/. Accessed April 20, 2025. [CrossRef]
- Gerck, E. (2021). On the Physical Representation of Quantum Systems. Computational Nanotechnology, 8(3), 13–18. Free author copy at https://www.researchgate.net/publication/355406639/ . Accessed April 20, 2025. [CrossRef]
- Neppe, V. M., & Close, E. R. (2020). The Neppe-Close Triadic Dimensional Vortical Paradigm: An Invited Summary. International Journal of Physics Research and Applications, 3, 001–014.
- Phillips, N. (2025). Retrieved from https://www.linkedin.com/in/nigel-phillips-coder/. Accessed April 20, 2025.
- Wolf, C. G. (2025). Values of the Fundamental Physical Constants. Retrieved from https://www.researchgate.net/publication/368809501 Accessed April 20, 2025.
- Fredkin, E. (1990). Digital Mechanics: An Informational Process Based on Reversible Universal Cellular Automata. Physica D, 45(1–3), 254–270.
- Wolfram, S. (2002). A New Kind of Science. Champaign, IL: Wolfram Media.
- Sorkin, R. D. (2003). Causal Sets: Discrete Gravity. arXiv:gr-qc/0309009.
- Hardy, J., Pomeau, Y., & de Pazzis, O. (1973). Time Evolution of a 2D Classical Lattice System. Physical Review Letters, 31, 276. Accessed April 20, 2025. [CrossRef]
- Konopka, T., Markopoulou, F., & Smolin, L. (2006). Quantum Graphity: Space as a Dynamical Graph of Interacting Qubits. arXiv:hep-th/0611197.
- Konopka, T. (2012). Causal Graph Dynamics and earlier work on Quantum Graphity. arXiv:hep-th/0611197.
- Gisin, N. (2019). Indeterminism in Physics, Classical Chaos, and Bohmian Mechanics. Foundations of Physics, 49, 707–721.
- Renou, M. O., Acín, A., & Navascués, M. (2025). Quantum Physics Falls Apart Without Imaginary Numbers. Scientific American. Retrieved from https://www.scientificamerican.com/article/quantum-physics-falls-apart-without-imaginary-numbers/. Accessed April 20, 2025.
- Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science.
- Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
- Bishop, E., & Bridges, D. (1985). Constructive Analysis. Springer.
- Schumacher, B., & Westmoreland, M. D. (2010). Quantum Processes, Systems, and Information. Cambridge University Press.
- Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.
- Knuth, D. E. (1997). The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley.
| 1 | The observation that there is an isomorphism between the proof systems and the models of computation. |

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).