Metabiology is a mathematical theory mainly based on algorithmic information theory and allows us to study an open-ended evolution of programs, that is, to study how fast the organisms/programs become more complex or more creative without...
moreMetabiology is a mathematical theory mainly based on algorithmic information theory and allows us to study an open-ended evolution of programs, that is, to study how fast the organisms/programs become more complex or more creative without never stagnate at a maximum level of complexity or creativity. We take, as starting point, the first chaitinian metabiological models in which the organisms are computable systems, Nature (or environment) is a hyper-computable system, mutations are randomly generated computable systems (that is, random algorithmic mutations) and the fitnesses are measured by how big is the output of the organisms. In this context, this paper focuses on two questions: Assuming that organisms are uncomputable systems, should metabiology become unsuitable or unsound? Or, on the other hand, assuming that Nature itself is a computable system, should metabiology become unsuitable or unsound? Thus, the main purpose is to demonstrate that metabiology walks towards a general theory of open-ended evolutionary systems, whether these systems are sub-computable, computable or hyper-computable. As a secondary purpose we show that scientific and philosophical consequences of our mathematical results spread across fundamental questions about biology and artificial life, as well as, about physics and artificial intelligence. To satisfy these two objectives, we build two new metabiological models for two new different configurations of organisms and nature. First, we demonstrate it is possible to build a metabiological evolution in which nature is a computable system and, hence, it makes the organisms and mutations to be sub-computable systems. To show this we introduce the recursive relative uncomputability (a computable/recursive version of the relative uncomputability that occurs among different Turing degrees). We do with Turing, Radó and Chaitin the same Skolem did with Cantor by making a relativization of the Busy-Beaver´s uncomputability in relation to the Omega number, so that this new uncomputability
can exist between a computer and any of his sub-computers. As a consequence, we introduce the “paradox” of uncomputability which says that exists at least one function that is not computable if we “look from the inside”, but that is computable if we “look from the outside”. Further, we correlate this pseudo-paradox with problems of human creativity and artificial intelligence and with problems of consciousness, artificial life and the computability of the Universe. Second, we build a metabiological model for the evolution of hyper-programs in which the organisms are hyper-computable systems of any finite order and nature is a hyper-program of ordinal order omega. In this last model we demonstrate it is possible an evolution of organisms/hyper-programs, with just “blind” random algorithmic mutations (it means, that do not take into consideration previous organisms/hyper-programs), which progressively leads the organisms/hyper-programs to be able of solving any problem in the arithmetical hierarchy. Allied to this, we discuss about computability or uncomputability of “living beings” and upon the possibility of mathematically studying metabiological evolutionary systems that can surpass, as much as we want, the “frontier” of the computable.