The DNA Computer

  • Christiane Rousseau
  • Yvan Saint-Aubin
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


Turing Machine Recursive Function Conjunctive Normal Form Tape Input Blank Cell 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Adleman. Molecular computation of solutions to combinatorial problems.Science, 266(11):1021–1024, November 1994.CrossRefGoogle Scholar
  2. [2]
    A. Church. An unsolvable problem of elementary number theory.American Journal of Mathematics, pages 345–363, 1936.Google Scholar
  3. [3]
    L. Kari and G. Thierrin. Contextual insertions/deletions and computability.Information and Computation, 131(1):47–61, 1996.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    G. Paun, G. Rozenberg, and A. Salomaa.{DNA Computing: New Computing Paradigms}. Springer, 1998.Google Scholar
  5. [5]
    M. Sipser.Introduction to the Theory of Computation. Course Technology, Boston, 2nd edition, 2006.Google Scholar
  6. [6]
    T.A. Sudkamp.Languages and Machine: An Introduction to the Theory of Computer Science. Addison-Wesley, Boston, 3rd edition, 2006.Google Scholar
  7. [7]
    A.M. Turing. On computable numbers with an application to the {Entscheidungsproblem}.Proceedings of the London Mathematical Society, 42:230–265, 1937.CrossRefGoogle Scholar
  8. [8]
    A. Yasuhara.Recursive Function Theory and Logic. Academic Press, New York and London, 1971.MATHGoogle Scholar

Copyright information

© Springer-Verlag New York 2008

Authors and Affiliations

  1. 1.Département de mathématiques et de statistiqueUniversité de MontréalCanada

Personalised recommendations