From: Eugene Leitl (eugene.leitl@lrz.uni-muenchen.de)
Date: Fri Jan 14 2000 - 21:05:00 MST
Matthew Gream writes:
> Perhaps someone more versed in computability metrics, universal (turing),
> theoretical (graph, numerical, parallel) and realisable (dna, biological,
> silicon, etc) machines could shed more light into this area.
DNA computations work by matching complementary patterns of hydrogen
bonded bases. Solvated macromolecules molecules are not very fast, and
are certainly not rapidly reconfigurable.
3d integrated molecular circuits (computronium) can run rings around
DNA computing, even in the best case.
This archive was generated by hypermail 2.1.5 : Fri Nov 01 2002 - 15:26:15 MST