This is the first book on DNA computing, a molecular approach that may revolutionize
computing-replacing silicon with carbon and microchips with DNA molecules. The book …

Reversible computing is a paradigm where computing models are defined so that they
reflect physical reversibility, one of the fundamental microscopic physical property of Nature …

We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-
complete. The result is found by showing that Rule 110 simulates deterministic Turing …

We present universal Turing machines with state-symbol pairs of (5, 5),(6, 4),(9, 3) and (15,
2). These machines simulate our new variant of tag system, the bi-tag system and are the …

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 …

We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that
the small universal Turing machines of Rogozhin, Minsky and others simulate Turing …

A reversible Turing machines is a computing model with a “backward deterministic” property,
which is closely related to physical reversibility. In this paper, we study the problem of finding …

Small fast universal Turing machines Page 1 Theoretical Computer Science 362 (2006) 171 –
195 www.elsevier.com/locate/tcs Small fast universal Turing machines Turlough Nearya,∗ …

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 …

We give small universal Turing machines with state-symbol pairs of (6, 2),(3, 3) and (2, 4).
These machines are weakly universal, which means that they have an infinitely repeated …