
arXiv: 0906.3213
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for proving non universality.
FOS: Computer and information sciences, Computer Science - Computational Complexity, Formal Languages and Automata Theory (cs.FL), Electronic computers. Computer science, QA1-939, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Computational Complexity (cs.CC), Mathematics
FOS: Computer and information sciences, Computer Science - Computational Complexity, Formal Languages and Automata Theory (cs.FL), Electronic computers. Computer science, QA1-939, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Computational Complexity (cs.CC), Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
