The Selfish Algorithm
Computational Complexity
2014-11-11 v1 Cellular Automata and Lattice Gases
Abstract
The principle of Generalized Natural Selection (GNS) states that in nature, computational processes of high computational sophistication are more likely to maintain/abide than processes of lower computational sophistication provided that sufficiently many resources are around to sustain the processes. In this paper we give a concrete set-up how to test GNS in a weak sense. In particular, we work in the setting of Cellular Automata and see how GNS can manifest itself in this setting.
Keywords
Cite
@article{arxiv.1411.2378,
title = {The Selfish Algorithm},
author = {Eduardo Hermo Reyes and Joost J. Joosten},
journal= {arXiv preprint arXiv:1411.2378},
year = {2014}
}