A brief history of cellular automata
ACM Computing Surveys (CSUR)
Fault-Tolerant Structures: Towards Robust Self-Replication in a Probabilistic Environment
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Evolution of Asynchronous Cellular Automata
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Rounds vs queries trade-off in noisy computation
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Fixed Point and Aperiodic Tilings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
High Complexity Tilings with Sparse Errors
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On fireflies, cellular systems, and evolware
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Turing universality in dynamical systems
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computational universality in symbolic dynamical systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Fixed-point tile sets and their applications
Journal of Computer and System Sciences
A turing machine resisting isolated bursts of faults
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
In a noisy cellular automaton, even if it is infinite, it is non-trivial to keep a bit of information for more than a constant number of steps. A clever solution in 2 dimensions has been applied to a simple 3-dimensional fault-tolerant cellular automaton. This technique did not solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3, or with non-synchronized transitions. With a more complex technique using a hierarchy of simulations, we construct an asynchronous one-dimensional reliable cellular automaton, which is also "self-organizing". This means that if the input information has constant size, the initial configuration can be homogenous: the hierarchy organizes itself. An application to information storage in positive-temperature Gibbs states is also given.