242 search results - page 19 / 49 » Zigzags in Turing Machines |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
COCO
2010
Springer
13 years 9 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...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
AGI
2011
12 years 11 months ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...