Infinite Time Cellular Automata: a Real Computation Model

Fabien Givors (1) , Grégory Lafitte (1) , Nicolas Ollinger (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly ω steps.

Mots clés: cellular automata; transfinite computation; BSS machines

Domaines: Autre [cs.OH]

Fabien Givors, Grégory Lafitte, Nicolas Ollinger. Infinite Time Cellular Automata: a Real Computation Model. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.111-120. ⟨hal-00542411⟩