This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman. Molecular computation of solutions to combinatorial problems.Science, 266(11):1021–1024, November 1994.
A. Church. An unsolvable problem of elementary number theory.American Journal of Mathematics, pages 345–363, 1936.
L. Kari and G. Thierrin. Contextual insertions/deletions and computability.Information and Computation, 131(1):47–61, 1996.
G. Paun, G. Rozenberg, and A. Salomaa.{DNA Computing: New Computing Paradigms}. Springer, 1998.
M. Sipser.Introduction to the Theory of Computation. Course Technology, Boston, 2nd edition, 2006.
T.A. Sudkamp.Languages and Machine: An Introduction to the Theory of Computer Science. Addison-Wesley, Boston, 3rd edition, 2006.
A.M. Turing. On computable numbers with an application to the {Entscheidungsproblem}.Proceedings of the London Mathematical Society, 42:230–265, 1937.
A. Yasuhara.Recursive Function Theory and Logic. Academic Press, New York and London, 1971.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2008 Springer-Verlag New York
About this chapter
Cite this chapter
Rousseau, C., Saint-Aubin, Y. (2008). The DNA Computer. In: Mathematics and Technology. Springer Undergraduate Texts in Mathematics and Technology . Springer, New York, NY. https://doi.org/10.1007/978-0-387-69216-6_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-69216-6_13
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-69215-9
Online ISBN: 978-0-387-69216-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)