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

2007/07/24 by D. Roglic, Darko Roglic, Roglic, D. · 1 voice · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Social Sciences · #Algorithm #Biology #Computer science #Evolution and Genetic Dynamics #Evolutionary Algorithms and Applications #Evolutionary Game Theory and Cooperation #Evolutionary biology #Evolvability #F.1.1 #FOS: Computer and information sciences #H.1.1 #Neural and Evolutionary Computing (cs.NE) #Theoretical computer science #cs.NE

paper · pdf · doi:10.48550/arxiv.0708.2686

published in arXiv (Cornell University) (Cornell University) · 7 pages, 1 table, 1 figure

arxiv created 2007/07/24 · openalex publication_date 2007/07/24 · arxiv published 2007/07/24 · arxiv updated 2007/07/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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.

Citations

• Reassembly of shattered chromosomes in Deinococcus radiodurans

Discussions

• Here's the abomination: arxiv.org/abs/0708.2686 I don't know if the author is the original author of the super-recursive article, or if they are somehow related, but it's been there since the very fi [bsky, 0 points, 2 comments]

Related

• Evolutionary Turing in the Context of Evolutionary Machines
• Evolutionary Computing
• Evolutionary Automata and Deep Evolutionary Computation
• La machine α: modèle générique pour les algorithmes naturels
• Why We Do Not Evolve Software? Analysis of Evolutionary Algorithms