Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem (1996)
| Venue: | Stanford University |
| Citations: | 46 - 11 self |
BibTeX
@INPROCEEDINGS{Andre96discoveryby,
author = {David Andre and Visiting Scholar},
title = {Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem},
booktitle = {Stanford University},
year = {1996},
pages = {28--31},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is difficult to program cellular automata. This is especially true when the desired computation requires global communication and global integration of information across great distances in the cellular space. Various human-written algorithms have appeared in the past two decades for the vexatious majority classification task for one-dimensional two-state cellular automata. This paper describes how genetic programming with automatically defined functions evolved a rule for this task with an accuracy of 82.326%. This level of accuracy exceeds that of the original 1978 Gacs-Kurdyumov-Levin (GKL) rule, all other known human-written rules, and all other known rules produced by automated methods. The rule evolved by genetic programming is qualitatively different from all previous rules in that it employs a larger and more intricate repertoire of domains and particles to represent and communicate information across the cellular space. 1.
