Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which characterize a procedure of assembly rather than computation, and which are intended as an abstraction of certain algorithmic processes of molecular biology. It has been previously shown that Turing assemblers with n-dimensional tapes can simulate arbitrary Turing machines for all n>1. Here it is shown that for n=1 even nondeterministic Turing assemblers have a sharply restricted computational capability, being able to successfully assemble only regular sets. The halting problem for linear Turing assemblers is therefore algorithmically solvable, and a characterization of the set of achievable final assemblies will be given as a subclass of th...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractIn this paper we establish a lower bound for the simultaneous complexity of the halting prob...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
In [1], Turing has established the well-known result of the indecidability of the general halting pr...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
International audienceIt is well known that one-tape Turing machines running in linear time are no m...
AbstractLet TM(k,l) be the set of one-tape Turing machines with k states and l symbols. It is known ...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractIt has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set ...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractIn this paper we establish a lower bound for the simultaneous complexity of the halting prob...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
In [1], Turing has established the well-known result of the indecidability of the general halting pr...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
International audienceIt is well known that one-tape Turing machines running in linear time are no m...
AbstractLet TM(k,l) be the set of one-tape Turing machines with k states and l symbols. It is known ...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractIt has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set ...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractIn this paper we establish a lower bound for the simultaneous complexity of the halting prob...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...