Effectively Calculable Quantum Mechanics
Physical Science International Journal · pp. 1–9 · Published 24 Mar 2016
10.9734/PSIJ/2016/24993Abstract
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are associated with Fibonacci numbers, this paper shows that the mathematical formalism of quantum mechanics is non-constructive since it permits an undecidable (or effectively impossible) subset of Hilbert space. On the other hand, as it is argued in the paper, if one believes that testability of predictions is the most fundamental property of any physical theory, one needs to accept that quantum mechanics must be an effectively calculable (and thus mathematically constructive) theory. With that, a way to reformulate quantum mechanics constructively, while keeping its mathematical foundation unchanged, leads to hypercomputation. In contrast, the proposed in the paper superselection rule, which acts by effectively forbidding a coherent superposition of quantum states corresponding to potential and actual infinity, can introduce computable constructivism in a quantum mechanical theory with no need for hypercomputation.
References (20)
- 1 An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford) [DOI]
- 2 Condensed Matter Field Theory [DOI]
- 3 On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines [DOI]
- 4 Quantum structure in cognition [DOI]
- 5 Foundations of Set Theory
- 6 Nine formulations of quantum mechanics [DOI]
- 7 Phyllotaxis as a Dynamical Self Organizing Process Part I: The Spiral Modes Resulting from Time-Periodic Iterations [DOI]
- 8 Quantum Finance
- 9 Quantum Dynamics for Classical Systems [DOI]
- 10 On the power of random access machines [DOI]
- 11 Aspects of Constructive Mathematics [DOI]
- 12 Why there is no such discipline as hypercomputation [DOI]
- 13 Programming for Mathematicians [DOI]
- 14 The case for hypercomputation [DOI]
- 15 Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem [DOI]
- 16 The quantum-like brain on the cognitive and subcognitive time scales
- 17 Diophantine approximation with applications to dynamical systems
- 18 Undecidability of the Criterion for Recognizing the Fibonacci Numbers [DOI]
- 19 The golden ratio: the story of phi, the world's most astonishing number [DOI]
- 20 Susskind's Challenge to the Hartle-Hawking No-Boundary Proposal and Possible Resolutions
Cited by 2
Lovemore Mamombe · 2017
A. Bolotin · 2015
Related research
- Closed Formulas for the Sums of Cubes of Generalized Fibonacci Numbers: Closed Formulas of Σn k=0W3 Σ k and n k=1W3 — shares topic coverage
- Some Properties of Generalized Fibonacci Numbers: Identities, Recurrence Properties and Closed Forms of the Sum Formulas ∑nk=0 xkWmk+j — shares topic coverage
- On Summing Formulas for Horadam Numbers — shares topic coverage
- Closed Formulas for the Sums of Squares of Generalized Fibonacci Numbers — shares topic coverage
- A Study on the Sums of Squares of Generalized Fibonacci Numbers: Closed Forms of the Sum Formulas Σn k=0 kxkW2 k and Σn k=1 kxkW2- k — shares topic coverage
Article metrics
Real usage data collected on this platform.
30
Page views
0
PDF downloads
3
Outbound clicks
2
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.