Effectively Calculable Quantum Mechanics
Issue: 2016 - Volume 10 [Issue 2]
Arkady Bolotin *
Ben-Gurion University of the Negev, Beersheba, Israel
*Author to whom correspondence should be addressed.
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.
Keywords: Computability, mathematical constructivism, hypercomputation, fibonacci numbers, golden ratio, fock states, superselection, actual and potential infinity