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
Abstract
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
STADWO
Revision history
Archival date: 2016-06-13
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2016-06-13

Total views
167 ( #21,869 of 45,585 )

Recent downloads (6 months)
50 ( #15,884 of 45,585 )

How can I increase my downloads?

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