@MISC{Volume_np-complete, author = {Fall Volume and Michael Hind and Martin Ruckert}, title = {NP-Complete}, year = {} }

Share

OpenURL

Abstract

Model of Molecular Computation As do abstract models of all types of computation, a model of molecular computation consists of two components, i.e., a mechanism for data representation (using molecules) and a set of operations on data (i.e., molecules and test cubes). The following model of molecular computation is simpler than Lipton's test tube model [2], but is more powerful than Adleman's restricted model. In our model [3], we use an alphabet \Sigma of any size. A test tube T is a set of strings oe over \Sigma, and a string is actually implemented by a DNA strand. 2 Existing models all assume that T is a multiset, i.e., a collection of elements that might be repeated. However, we will not use this feature in the present model. The construction of strings and the interpretation of the meaning of the strings depend on the problem solved, and constitute an important part of the design of 1 The number is obtained based on the fact that 18 grams of water contains 6.023\Theta10 23...