Advertisement

Algorithmica

, Volume 24, Issue 2, pp 87–95 | Cite as

A Comparison of Resource-Bounded Molecular Computation Models

  • B. Fu
  • R. Beigel

Abstract.

The number of molecular strands used by a molecular algorithm is an important measure of the algorithm's complexity. This measure is also called the volume used by the algorithm. We prove that three important polynomial-time models of molecular computation with bounded volume are equivalent to models of polynomial-time Turing machine computation with bounded nondeterminism. Without any assumption, we show that the Split operation does not increase the power of polynomial-time molecular computation. Assuming a plausible separation between Turing machine complexity classes, the Amplify operation does increase the power of polynomial-time molecular computation.

Keywords

Computation Model Turing Machine Complexity Class Important Measure Molecular Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1999

Authors and Affiliations

  • B. Fu
    • 1
  • R. Beigel
    • 2
  1. 1.Epson Palo Alto Laboratory, 3145 Porter Drive, Suite 104, CA 94304, USA. fu.bin@erd.epson.com.US
  2. 2.Department of Electrical Engineering and Computer Science, University of Illinois at Chicago (M/C 154), 851 S. Morgan St., Room 1120, Chicago, IL 60607-7053, USA. beigel@eecs.uic.edu. http://www.eecs.uic.edu/~beigel.US

Personalised recommendations