The Intrinsic Universality Problem of One-Dimensional Cellular Automata

Authors:
Nicolas Ollinger
Affiliations:
-
Venue:
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2003

Citing 10
Cited 8

On the limit sets of cellular automata

SIAM Journal on Computing
Classifying circular cellular automata

Physica D
The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
Rice's theorem for the limit sets of cellular automata

Theoretical Computer Science
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Inducing an order on cellular automata by a grouping operation

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

Discrete Mathematics
The Quest for Small Universal Cellular Automata

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Universality in cellular automata

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences

Directed Percolation Arising in Stochastic Cellular Automata Analysis

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On factor universality in symbolic spaces

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Four states are enough!

Theoretical Computer Science
Achieving universal computations on one-dimensional cellular automata

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Turing universality in dynamical systems

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
How common can be universality for cellular automata?

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Grids and universal computations on one-dimensional cellular automata

Natural Computing: an international journal
Towards a rice theorem on traces of cellular automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Undecidability results of cellular automata properties usually concern one time step or long time behavior of cellular automata. Intrinsic universality is a dynamical property of another kind. We prove the undecidability of this property for one-dimensional cellular automata. The construction used in this proof may be extended to other properties.