Infinite Time Cellular Automata: A Real Computation Model
Cellular Automata and Lattice Gases
2010-12-07 v1 Computational Complexity
Logic in Computer Science
Abstract
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 \omega steps.
Keywords
Cite
@article{arxiv.1012.1221,
title = {Infinite Time Cellular Automata: A Real Computation Model},
author = {Fabien Givors and Grégory Lafitte and Nicolas Ollinger},
journal= {arXiv preprint arXiv:1012.1221},
year = {2010}
}
Comments
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)