×
Jun 20, 2015 · We investigate the classes of languages acceptable by such devices with small time bounds in the range between real time and linear time, i.e., ...
Abstract. Reversible Turing machines with a working tape and a one- way or two-way read-only input tape are considered. We investigate the.
A Hierarchy of Fast Reversible Turing Machines. https://doi.org/10.1007/978-3 ... Reversible Turing machines and polynomial time reversibly computable functions.
People also ask
A hierarchy of fast reversible turing machines ; Jean Krivine, Jean-Bernard Stefani · 16 · Springer · 2015 · 29-44.
A reversible Turing machine is one whose transition function is $1:1$, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling ...
Mar 29, 2016 · Our main results are that the group of Turing machines in one dimension is neither amenable nor residually finite, but is locally embeddable in finite groups.
Missing: Hierarchy | Show results with:Hierarchy
As any involution is injective (hence reversible), any time-symmetric Turing machine is a reversible Turing machine. ... A Hierarchy of Fast Reversible Turing ...
Aug 2, 2012 · Is it possible to get an estimate of the size of a Turing machine computing fα(n), for a given α (I am especialy interested in moderately large ...
Missing: Reversible | Show results with:Reversible
A reversible Turing machine is one whose transition function is 1 : 1 , so that no instantaneous description (ID) has more than one predecessor.
Mar 29, 2016 · We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which ...