6533b827fe1ef96bd12859dc

RESEARCH PRODUCT

Logic, Computing and Biology

Andrés Moya

subject

Turing machinesymbols.namesakeRecursionTheoretical computer scienceComputer scienceComputational logicFormal languagesymbolsAnalogyComputerApplications_COMPUTERSINOTHERSYSTEMSGödel's incompleteness theoremsUnconventional computingHalting problem

description

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.

yearjournalcountryeditionlanguage
2015-01-01
https://doi.org/10.1007/978-3-319-16970-5_6