Randomness and determination, from physics and computing towards biology

5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various theoretical context, or, to put it otherwise, there is no unifying notion of finite time randomness. In particular, we will introduce, classical (dynamical), quantum and algorithmic randomness. In physics, differing probabilities, as a measure of randomness, evidentiate the differences between the various notions. Yet, asymptotically, one is universal: Martin-LÖf randomness provides a clearly defined and robust notion of randomness for infinite sequences of numbers. And this is based on recursion theory, that is the theory of effective computability. As a recurring issue, the question will be raised of what randomenss means in biology, phylogenesis in particular. Finally, hints will be given towards a thesis, relating finite time randomness and time irreversibility in physical processes. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Longo, G. (2009). Randomness and determination, from physics and computing towards biology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 49–61). https://doi.org/10.1007/978-3-540-95891-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free