The complexity of Boolean functions
The complexity of Boolean functions
Inducing an order on cellular automata by a grouping operation
Discrete Applied Mathematics
Simple Computation-Universal Cellular Spaces
Journal of the ACM (JACM)
Two-States Bilinear Intrinsically Universal Cellular Automata
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Cellular Automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Universality in cellular automata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Simulations between multi-dimensional deterministic and alternating cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Theory of cellular automata: a survey
Theoretical Computer Science
The Complexity of Small Universal Turing Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
On factor universality in symbolic spaces
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Theoretical Computer Science
Abstract geometrical computation 4: Small Turing universal signal machines
Theoretical Computer Science
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How common can be universality for cellular automata?
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Fundamenta Informaticae - Cellular Automata
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Theoretical Computer Science
Spiking neural P systems with rules on synapses
Theoretical Computer Science
| Hi-index | 0.01 |
We formalize the idea of intrinsically universal cellular automata, which is strictly stronger than classical computational universality. Thanks to this uniform notion, we construct a new one-dimensional universal automaton with von Neumann neighborhood and only 6 states, thus improving the best known lower bound both for computational and intrinsic universality.