Four states are enough!

Authors:
N. Ollinger;G. Richard
Affiliations:
Laboratoire dinformatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, 39 rue Joliot-Curie, 13 013 Marseille, France;Laboratoire dinformatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, 39 rue Joliot-Curie, 13 013 Marseille, France and Groupe de Recherche en Informatique, Image, Automa ...
Venue:
Theoretical Computer Science
Year:
2011

Citing 15
Cited 5

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results

Discrete Mathematics
Simple Computation-Universal Cellular Spaces

Journal of the ACM (JACM)
Upper bound on the products of particle interactions in cellular automata

Physica D
A new kind of science

A new kind of science
The Quest for Small Universal Cellular Automata

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Intrinsic Universality Problem of One-Dimensional Cellular Automata

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The circuit value problem is log space complete for P

ACM SIGACT News
Theory of cellular automata: a survey

Theoretical Computer Science
Cellular Automata

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)
Tessellations with local transformations

Journal of Computer and System Sciences
Bulking II: Classifications of cellular automata

Theoretical Computer Science
Bulking I: An abstract theory of bulking

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

Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata

Theoretical 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
From One-dimensional to Two-dimensional Cellular Automata

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata

Theoretical Computer Science
The two-handed tile assembly model is not intrinsically universal

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents a 1D intrinsically universal cellular automaton with four states for the first neighbor's neighborhood, improving on the previous lower bound and getting nearer to the Turing universality bound. Intrinsic universality is discussed. Construction and proof rely on a combination of bulking techniques with programming using particles and collisions.