52 search results - page 5 / 11 » Simulating Turing machines on Maurer machines |
COCO
2010
Springer
15 years 1 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
114
click to vote
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
TCS
2008
14 years 11 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
115
click to vote
JCSS
2000
14 years 11 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...