Surface-based dna computations

This thesis is focused on the demonstration of the universality of surface-based DNA computers. A fundamental concept in Computer Science is that of the Universal Turing general-purpose (universal) computer is defined as one which can compute anything that is computable. It has been shown that any computer which is able to simulate Boolean logic circuits of any complexity is such a general-purpose computer. The field of DNA computing was founded in 1994 by Adleman's solution of a 7-bit instance of the Hamiltonian Path problem. This work, as well as most of the subsequent experimental and theoretical investigation in the area, focused primarily upon the solution of NP-complete problems, which are a subset of the larger universal class of problems. In the present work a surface DNA computer capable of simulating Boolean logic circuits is demonstrated. This was done by constructing NOR and OR gates and combining them into a simple logic circuit. The NOR gate is one of the universal gates in Boolean logic, meaning that any other logic gate can be built from it alone. The circuit was solved by using DNA-based operations, demonstrating the universal nature of this surface DNA computing model.