We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another related result shows that Rule 110, a well-known elementary cellular automaton, is efficiently universal. We also discuss some old and new universal ...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
This paper surveys some topics in the area of small universal Turing machines and tag systems. In p...
This paper surveys some topics in the area of small universal Turing machines and tag systems. In p...
In this mini-survey we discuss time complexity and program size results for universal Turing machine...
In this mini-survey we discuss time complexity and program size results for universal Turing machine...
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the sma...
Key words: small universal Turing machine, polynomial time, universality. Abstract. We present a num...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
This paper surveys some topics in the area of small universal Turing machines and tag systems. In p...
This paper surveys some topics in the area of small universal Turing machines and tag systems. In p...
In this mini-survey we discuss time complexity and program size results for universal Turing machine...
In this mini-survey we discuss time complexity and program size results for universal Turing machine...
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the sma...
Key words: small universal Turing machine, polynomial time, universality. Abstract. We present a num...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...