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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages, 1 table, 1 figure

Keywords

Neural and Evolutionary Computing, F.1.1; H.1.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/136332

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0708.2686
 http://arxiv.org/abs/0708.2686

Collections

arXiv