Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2010
Springer

favoriteEmaildiscussreport

88views Education» more CORR 2010»

Infinite Time Cellular Automata: A Real Computation Model

13 years 1 months ago

Infinite Time Cellular Automata: A Real Computation Model

Download hal.archives-ouvertes.fr

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.

Fabien Givors, Grégory Lafitte, Nicolas Oll

Real-time Traffic

CORR 2010 | Education | Infinite Time | Time Cellular Automata | Transfinite Time Model |

claim paper

Related Content

» Cellular Automata Decidability and Phasespace

» Computational complexity of dynamical systems The case of cellular automata

» Interactive Terrain Simulation and Force Distribution Models in Sand Piles

» RealTime Language Recognition by Alternating Cellular Automata

» Fault tolerance in cellular automata at high fault rates

» Dynamic Neighbourhood Cellular Automata

» Real Time Language Recognition on 2D Cellular Automata Dealing with Nonconvex Neighborhood...

» Asynchronous adaptive time step in quantitative cellular automata modeling

» Optimal infinite scheduling for multipriced timed automata

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Fabien Givors, Grégory Lafitte, Nicolas Ollinger

Comments (0)