Infinite Time Cellular Automata: A Real Computation Model
classification
🌊 nlin.CG
cs.CCcs.LO
keywords
infinitetimemodelautomatacellularcomputationmachinesreal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.