Computability and physical theories

作者: Robert Geroch , James B. Hartle

DOI: 10.1007/BF01886519

关键词:

摘要: The familiar theories of physics have the feature that application theory to make predictions in specific circumstances can be done by means an algorithm. We propose a more precise formulation this feature—one based on issue whether or not physically measurable numbers predicted are computable mathematical sense. Applying one approach quantum gravity, there found indications may exist no such algorithms case. Finally, we discuss existence algorithm implement should adopted as criterion for acceptable physical theories. “Can it then is... something use unraveling universe learned from philosophy computer design?” —J. A. Wheeler

参考文章(8)
G. Kreisel, A Notion of Mechanistic Theory Logic and Probability in Quantum Mechanics. ,vol. 29, pp. 3- 18 ,(1976) , 10.1007/978-94-010-9466-5_1
G. Faltings, Endlichkeitssätze für abelsche Varietäten über Zahlkörpern Inventiones Mathematicae. ,vol. 73, pp. 349- 366 ,(1983) , 10.1007/BF01388432
Stephen Wolfram, Undecidability and intractability in theoretical physics. Physical Review Letters. ,vol. 54, pp. 735- 738 ,(1985) , 10.1103/PHYSREVLETT.54.735
John Archibald Wheeler, The computer and the universe International Journal of Theoretical Physics. ,vol. 21, pp. 557- 572 ,(1982) , 10.1007/BF02650185
Marian Boylan Pour-el, Ian Richards, A computable ordinary differential equation which possesses no computable solution Annals of Mathematical Logic. ,vol. 17, pp. 61- 90 ,(1979) , 10.1016/0003-4843(79)90021-4