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
AbstractI 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.
Similar books and articles
Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p(2013).Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2017 3rd Ed 686p(2017).
Computation, among other things, is beneath us.Selmer Bringsjord - 1994 - Minds and Machines 4 (4):469-88.
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
Turing Machines and Semantic Symbol Processing: Why Real Computers Don’t Mind Chinese Emperors.Richard Yee - 1993 - Lyceum 5 (1):37-59.
Consistency Problem and “Unexpected Hanging Paradox” (An answering to P=NP Problem).Farzad Didehvar - unknown
The Surprise Examination Paradox and the Second Incompleteness Theorem.Shira Kritchman & Ran Raz - unknown
Liar-type Paradoxes and the Incompleteness Phenomena.Makoto Kikuchi & Taishi Kurahashi - 2016 - Journal of Philosophical Logic 45 (4):381-398.
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
Added to PP
Historical graph of downloads