2 search results - page 1 / 1 » Ultrametric Finite Automata and Turing Machines |
CORR
2010
Springer
13 years 1 months 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 ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...