AbstractFour universal Turing machines are given with strong limitations on the number of left instructions in their program. One of the machines is morever non-erasing, i.e. it does not erase any 1 written on the tape
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
In the following sections we show, by a simple direct construction, that computations done by Turing...
AbstractFour universal Turing machines are given with strong limitations on the number of left instr...
AbstractA new definition of universal Turing machines is introduced which allows to obtain universal...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractA (one tape, deterministic) Turing Machine is f(n) ink bounded if the machine changes a symb...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
Bennett proved that any irreversible Turing machine can be simulated by reversible one. However, Ben...
This work introduces a restricted variant of the Turing machine which cannot move left, thus return ...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
AbstractUniversality, provability and simplicity are key notions in computability theory. There are ...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
In the following sections we show, by a simple direct construction, that computations done by Turing...
AbstractFour universal Turing machines are given with strong limitations on the number of left instr...
AbstractA new definition of universal Turing machines is introduced which allows to obtain universal...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
AbstractA (one tape, deterministic) Turing Machine is f(n) ink bounded if the machine changes a symb...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
Bennett proved that any irreversible Turing machine can be simulated by reversible one. However, Ben...
This work introduces a restricted variant of the Turing machine which cannot move left, thus return ...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
AbstractUniversality, provability and simplicity are key notions in computability theory. There are ...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
In the following sections we show, by a simple direct construction, that computations done by Turing...
DOI
Add to ORKG