@TECHREPORT{Beaver_molecularcomputing, author = {Donald Beaver}, title = {Molecular Computing}, institution = {}, year = {} }

Share

OpenURL

Abstract

We design a molecular Turing machine and determine the complexity of the problems solvable by molecular computers. In [A94], a combinatorial molecular experiment to solve the NP-complete problem of Hamiltonian Path was proposed and implemented. Using our design, we show that such molecular computers can in fact compute PSPACE, under the generous assumptions implicit in [A94]. Under stronger and somewhat more practical restrictions, which [A94] fails to satisfy, we show that molecular computers are limited to solving problems in P. 1 Introduction Molecular and quantum computers have recently been considered as alternatives to standard models such as Turing machines, PRAM's, or logical circuits [S94, Si94, A94, B94]. Shor has shown that quantum computers can factor large numbers and calculate discrete logarithms in polynomial time, even though no known polynomial-time algorithm is known [S94]. Adleman has proposed a molecular "computer" that solves the NPcomplete Hamiltonian Path proble...