Infinite Time Cellular Automata: A Real Computation Model

Details Infinite Time Cellular Automata: A Real Computation Model Infinite Time Cellular Automata: A Real Computation Model

2010-12-03

arxiv.org/abs/1012.1221v1

Nonlinear Sciences

Cellular Automata and Lattice Gases

Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Infinite Time Cellular Automata: A Real Computation Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite Time Cellular Automata: A Real Computation Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Time Cellular Automata: A Real Computation Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515725