Computational Reducibility theorem

Sergej  Materov

ПРЕПРИНТ

Эта статья является препринтом и не была отрецензирована.
О результатах, изложенных в препринтах, не следует сообщать в СМИ как о проверенной информации.

Computational Reducibility theorem

S. Materov

2026-04-02

https://doi.org/10.24108/preprints-3114827

A Principled Limitation of Wolfram's Computational Irreducibility for Finite Unitary Quantum Systems. The sufficiency of a single slice to predict the entire evolution. After diagonalization, prediction cost is independent of the time horizon. Time is not a fundamental step-by-step process—it emerges from the spectrum of the evolutionary operator. Therefore, the "future" is not ontologically inaccessible: it is already fully encoded in the spectral structure of the present. Computational reducibility is not a trick involving substitution into a formula. It reflects the fact that in Quantumograph, time and spectrum are the same thing, described in different languages.

Ссылка для цитирования:

Materov S. 2026. Computational Reducibility theorem. PREPRINTS.RU. https://doi.org/10.24108/preprints-3114827

Список литературы

1. T. Konopka, F. Markopoulou, and L. Smolin, "Quantum Graphity," *arXiv preprint hep-th/0611197*, 2006. DOI: 10.48550/arXiv.hep-th/0611197

2. T. Konopka and F. Markopoulou, "Constrained Mechanics and Noiseless Subsystems," *arXiv preprint gr-qc/0601028*, 2006. DOI: 10.48550/arXiv.gr-qc/0601028

3. J. Maldacena, S. H. Shenker, and D. Stanford, "A bound on chaos," J. High Energy Phys., vol. 2016, no. 8, p. 106, 2016. DOI: 10.1007/JHEP08(2016)106

4. N. Tsuji, T. Shitara, and M. Ueda, "Bound on the exponential growth rate of out-of-time-ordered correlators," Phys. Rev. E, vol. 98, no. 1, p. 012216, 2018. DOI: 10.1103/PhysRevE.98.012216

5. A. Dymarsky and M. Smolkin, "Krylov complexity in conformal field theory," Phys. Rev. D, vol. 104, no. 8, p. 086025, 2021. DOI: 10.1103/PhysRevD.104.086025

6. D. Pazó and M. Cencini, "Universal scaling of Lyapunov-exponent fluctuations in space-time chaos," Phys. Rev. E, vol. 87, no. 6, p. 062909, 2013. DOI: 10.1103/PhysRevE.87.062909

7. N. Israeli and N. Goldenfeld, "On computational irreducibility and the predictability of complex physical systems," *arXiv preprint nlin/0309047*, 2003. DOI: 10.48550/arXiv.nlin/0309047

8. I. García-Mata, M. Saraceno, and M. E. Spina, "Classical decays in decoherent quantum maps," Phys. Rev. E, vol. 67, no. 4, p. 046215, 2003. DOI: 10.1103/PhysRevE.67.

9. X. Huang and B. Zhang, "Growth of a renormalized operator as a probe of chaos," arXiv preprint arXiv:2110.15306, 2021.

10. S. Wolfram, A New Kind of Science. Champaign, IL: Wolfram Media, 2002.

11. H. Zwirn and J.-P. Delahaye, "Unpredictability and computational irreducibility," arXiv preprint arXiv:1111.4121, 2011. DOI: 10.48550/arXiv.1111.4121

12. G. J. Martinez, H. Zenil, and S. V. Chvykov, "Wolfram's Classification and Computation in Cellular Automata Classes III and IV," in Irreducibility and Computational Equivalence, Springer, 2012. DOI: 10.1007/978-3-642-35482-2_6

13. S. Materov, “Theorem on the absence of asymptotic chaos”, 2026, DOI: 10.5281/zenodo.19343624

14. S. Materov, “Quantumograph: A Testable Quantum Graph Theory of Spacetime” 2026, DOI: 10.5281/zenodo.18410313

ПРЕПРИНТ

ИНФОРМАЦИЯ

Использование куки-файлов