The universal evolutionary computer based on super-recursive algorithms of evolvability
| dc.creator | Roglic, D. | |
| dc.date | 2007-07-24 | |
| dc.date.accessioned | 2026-07-07T08:24:25Z | |
| dc.date.available | 2026-07-07T08:24:25Z | |
| dc.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. | |
| dc.description | 7 pages, 1 table, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0708.2686 | |
| dc.identifier | http://arxiv.org/abs/0708.2686 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/136332 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | F.1.1; H.1.1 | |
| dc.title | The universal evolutionary computer based on super-recursive algorithms of evolvability | |
| dc.type | text |