Abstract
Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.
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
References
Chaitin G (2007) Meta maths. The quest for Omega. Atlantic Books, London
KĂ¼ppers BO (1990) Information and the origin of life. MIT Press, Cambridge, Massachusetts
Nagel E, Newman JR (1994) El teorema de Gödel. Editorial Tecnos, Madrid
Penrose R (1991) La nueva mente del emperador. Biblioteca Mondadori, Madrid
Piñeiro G (2010) Gödel ∀ (para todos). El teorema matemĂ¡tico que ha fascinado mĂ¡s allĂ¡ de las ciencias exactas. Ediciones Destino, Barcelona
Quine WV (1972) Mathematical logic. Harvard University Press, Cambridge, Massachusetts
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Moya, A. (2015). Logic, Computing and Biology. In: The Calculus of Life. SpringerBriefs in Biology. Springer, Cham. https://doi.org/10.1007/978-3-319-16970-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-16970-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16969-9
Online ISBN: 978-3-319-16970-5
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)