461 search results - page 3 / 93 » Simulating the universe |
77
Voted
MCU
2001
14 years 11 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...
STACS
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...