52 search results - page 6 / 11 » Simulating Turing machines on Maurer machines |
MCU
2001
13 years 8 months ago
2001
Abstract. A direct universal extended H system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct constr...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We aim to search for cellular automata candidate to an automatic system for the demonstration of collision-based universality and that can be able to simulate Turing machines i...
FUIN
2006
13 years 7 months ago
2006
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
CORR
2010
Springer
13 years 4 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 ...
SERVICEWAVE
2010
13 years 5 months ago
2010
Abstract. With the emergence of Cloud Computing resources of physical machines have to be allocated to virtual machines (VMs) in an ondemand way. However, the efficient allocation ...