
TL;DR
This paper develops a mathematical problem theory linking evolution, cognition, and Turing completeness, explaining how biological systems solve problems and giving rise to mathematics and computing.
Contribution
It introduces a novel problem theory that integrates set and computing theories, explaining the evolution of cognition and Turing completeness from a biological perspective.
Findings
Defines three problem-solving methods: routine, trial, and analogy.
Constructs a hierarchy of resolvers based on computing capacity.
Shows how problems underpin mathematics and computing in biology.
Abstract
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here is why, Why are we Turing complete? Being Turing complete also means that somehow our brain implements the function that a universal Turing machine implements. The point is that evolution achieved Turing completeness, and then the explanation should be evolutionary, but our explanation is mathematical. The trick is to introduce a mathematical theory of problems, under the basic assumption that solving more problems provides more survival opportunities. So we build a problem theory by fusing set and computing theories. Then we construct a series of resolvers, where each resolver is defined by its computing capacity, that exhibits the following property:…
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
TopicsAlexander von Humboldt Studies · Evolutionary Algorithms and Applications · Origins and Evolution of Life
