For the most important class of problems in computer science, nondeterministic polynomial complete problems, nondeterministic UTMs (NUTMs) are theoretically exponentially faster fast of both classical UTM and quantum UTM (QUTM). This project is based on Thue string rewriting systems, and therefore avoids the limitations of most previous DNA computation schemes: all computation is local (simple string changes) so there is no need for communication and no c 'you need to order operations. The project exploits DNA's ability to replicate to execute an exponential number of computational pathways in P time. Each Thue rewriting step is embedded in a DNA modification implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis . Say no to plagiarism. Get a tailor-made essay on "Why Violent Video Games Shouldn't Be Banned"? Get an original essay We demonstrate that the design works using both computational modeling and in vitro molecular biology experimentation: the design is thermodynamically favorable, microprogramming can be used to encode arbitrary Thue rules, and all classes of the Thue rule can be implemented and the implementation of non-deterministic rules. In a NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference allows a NUTM to exchange space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, because to quote Richard Feynman “there is a lot of room at the bottom”. This means that a desktop DNA NUTM could potentially use more processors than all the world's electronic computers combined, and thus outclass the world's current fastest supercomputer, while consuming a small fraction of its energy. However, we recognize that further experimentation is required to complete the physical construction of a fully functional NUTM. In fact, we are not aware of any fully functional molecular implementation of a UTM, much less a NUTM. The key point in implementing a UTM with respect to special purpose hardware is that special purpose hardware typically needs to be redesigned for each new problem. In contrast, in a UTM only the software needs to be changed for a new problem and the hardware remains fixed. The situation for molecular UTMs is currently similar to that of QUTMs where hardware prototypes have performed significant computations, but there is no complete physical implementation of a QUTM. The biggest challenge in developing a working NUTM is controlling "noise". However, noise was a serious problem in the early days of electronic computers; the problem is now substantially solved. Noise is also the most serious obstacle to the physical implementation of QUTMs and may actually make them physically impossible. In contrast, in a NUTM, it is possible to employ well-known classical approaches to deal with noise. These classical methods allow unreliable components to be combined to form extremely reliable overall systems. The way in NUTM for noise reduction is to use error correcting codes. These codes are used everywhere in electronic computers and are also essential for QUTMs. Classic error-correcting code methods can be ported directly to NUTM. Another way is repeating the calculations. The simplest way to reduce noise is to repeat the calculations, both spatially and temporally. Using a polynomial number of repetitions does not affect the