113
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
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 ...