David Wolpert on impossibility, incompleteness, the liar paradox, the limits of computation, a non-quantum mechanical uncertainty principle and the universe as computer—the ultimate theorem in Turing Machine Theory

Download Edit this record How to cite View on PhilPapers
I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility,incompleteness, the limits of computation,and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things,a non-quantum mechanical uncertainty principle and a proof of monotheism.
PhilPapers/Archive ID
Upload history
Archival date: 2016-06-13
View other versions
Added to PP index

Total views
232 ( #22,299 of 55,817 )

Recent downloads (6 months)
40 ( #19,481 of 55,817 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.