
TL;DR
This paper proposes an existence principle that enables physical systems to perform reasoning beyond Turing machine capabilities, introducing the concept of creative systems that can prove undecidable formulas.
Contribution
It introduces the existence principle and the notion of creative systems, expanding the understanding of physical reasoning processes beyond traditional Turing machine models.
Findings
Existence principle allows physical causation for Turing-computable functions.
Creative systems can prove undecidable formulas in formal systems.
Computer experiments support the hypothesis about creative systems.
Abstract
A fundamental question is whether Turing machines can model all reasoning processes. We introduce an existence principle stating that the perception of the physical existence of any Turing program can serve as a physical causation for the application of any Turing-computable function to this Turing program. The existence principle overcomes the limitation of the outputs of Turing machines to lists, that is, recursively enumerable sets. The principle is illustrated by productive partial functions for productive sets such as the set of the Goedel numbers of the Turing-computable total functions. The existence principle and productive functions imply the existence of physical systems whose reasoning processes cannot be modeled by Turing machines. These systems are called creative. Creative systems can prove the undecidable formula in Goedel's theorem in another formal system which is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cellular Automata and Applications · Logic, Reasoning, and Knowledge
