The universal evolutionary computer based on super-recursive algorithms of evolvability

TL;DR

This paper introduces the Universal Evolutionary Computer, a theoretical model based on super-recursive algorithms that can compute functions beyond Turing computability, inspired by natural evolutionary processes.

Contribution

It presents a novel theoretical framework for a universal computer leveraging super-recursive algorithms rooted in evolvability, expanding the boundaries of computability.

Findings

Proposes a model of a computer with limited intelligence but high problem-solving efficiency.

Demonstrates that natural evolution mechanisms can compute non-Turing computable functions.

Introduces the concept of super-recursive algorithms based on evolvability.

Abstract

This work exposes which mechanisms and procesess in the Nature of evolution compute a function not computable by Turing machine. The computer with intelligence that is not higher than one bacteria population could have, but with efficency to solve the problems that are non-computable by Turing machine is represented. This theoretical construction is called Universal Evolutinary Computer and it is based on the superecursive algorithms of evolvability.