Theoretical and Experimental DNA Computation (Natural ...

4.14 Bibliographical Notes 107
We have proposed a so-called strong model of DNA computation, which
we believe allows realistic assessment of the time complexities of algorithms
within it. This model, if the splice operation is trivially included, not only
provides realistic estimates of time complexities, but is also Turing-complete.
We have also demonstrated how existing models of computation (Boolean
circuits and the P-RAM) may be effectively simulated in DNA.
We believe that success in the search for “killer applications” is the only
means by which there will be sustained practical interest in DNA computation.
Success is only a likely outcome if DNA computations can be described that
will require computational resources of similar magnitude to those required by
conventional solutions. If, for example, we were to establish polylogarithmic
time computations using only a polynomial volume of DNA, then this would
be one scenario in which “killer applications” might well ensue. In this case,
we might imagine that the vast potential for parallelisation may finally be
effectively harnessed.
4.14 Bibliographical Notes
For an in-depth yet accessible treatment of computational complexity, the
reader is directed to [145]. This text includes short sections on the complexity
class NC and P-completeness. Detailed discussion of parallel computation
(with specific reference to the P-RAM) is collected in [66].