Recursivity in quantum mechanics
HTML articles powered by AMS MathViewer
- by John C. Baez
- Trans. Amer. Math. Soc. 280 (1983), 339-350
- DOI: https://doi.org/10.1090/S0002-9947-1983-0712264-X
- PDF | Request permission
Abstract:
The techniques of effective descriptive set theory are applied to the mathematical formalism of quantum mechanics in order to see whether it actually provides effective algorithms for the computation of various physically significant quantities, e.g. matrix elements. Various Hamiltonians are proven to be recursive (effectively computable) and shown to generate unitary groups which act recursively on the Hilbert space of physical states. In particular, it is shown that the $n$-particle Coulombic Hamiltonian is recursive, and that the time evolution of $n$-particle quantum Coulombic systems is recursive.References
- O. Aberth, Computable analysis, McGraw-Hill, New York, 1980.
G. Kreisel, A notion of mechanistic theory, Synthese 29 (1974), 11-26.
- Yiannis N. Moschovakis, Descriptive set theory, Studies in Logic and the Foundations of Mathematics, vol. 100, North-Holland Publishing Co., Amsterdam-New York, 1980. MR 561709
- Marian Boykan Pour-El and Ian Richards, The wave equation with computable initial data such that its unique solution is not computable, Adv. in Math. 39 (1981), no. 3, 215–239. MR 614161, DOI 10.1016/0001-8708(81)90001-3 M. Reed and B. Simon, Methods of modern mathematical physics. Vols I, II, Academic Press, New York, 1972/1975.
Bibliographic Information
- © Copyright 1983 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 280 (1983), 339-350
- MSC: Primary 81B99; Secondary 03D80, 03E15, 81C10
- DOI: https://doi.org/10.1090/S0002-9947-1983-0712264-X
- MathSciNet review: 712264