Abstract
The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature—one based on the issue of whether or not the physically measurable numbers predicted by the theory are computable in the mathematical sense. Applying this formulation to one approach to a quantum theory of gravity, there are found indications that there may exist no such algorithms in this case. Finally, we discuss the issue of whether the existence of an algorithm to implement a theory should be adopted as a criterion for acceptable physical theories.
“Can it then be that there is... something of use for unraveling the universe to be learned from the philosophy of computer design?”
—J. A. Wheeler(1)
Similar content being viewed by others
References
J. A. Wheeler,Int. J. Theor. Phys. 21, 557 (1982).
C. W. Misner, K. S. Thorne, and J. A. Wheeler,Gravitation (Freeman, San Francisco, 1970).
A. Yasuhara,Recursive Function Theory and Logic (Academic Press, New York, 1971).
G. Faltings,Invent. Math. 73, 349 (1983).
Int. J. Theor. Phys. 21, Nos. 3–4 (1982).
S. Wolfram,Phys. Rev. Lett. 54, 735 (1985);Sci. Am. 251, 188 (Sept. 1984).
B. N. Taylor, W. H. Parker, and D. N. Langenberg,Rev. Mod. Phys. 41, 375 (1969).
M. B. Pour-El and I. Richards,Ann. Math. Logic 17, 61 (1979);Adv. Math. 39, 215 (1981).
J. B. Hartle, to appear.
W. Haken, inWord Problems, W. W. Boone, F. B. Cannonito, and R. C. Lyndon, eds. (North-Holland, Amsterdam, 1973).
A. Komar,Phys. Rev. B 133, 542 (1964).
G. Kreisel,Synthese 29, 11 (1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Geroch, R., Hartle, J.B. Computability and physical theories. Found Phys 16, 533–550 (1986). https://doi.org/10.1007/BF01886519
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01886519