In this paper, we analyze the problem of prediction in physics from the computational viewpoint. We show that physical paradigms like Laplace determinism, statistical determinism, etc., can be naturally explained by this computational analysis. In our explanations, we use the notions of the Algorithmic Information Theory such as Kolmogorov complexity and algorithmic randomness, as well as the novel, more physics-oriented variants of these notions
The book is intended to explain the larger and intuitive concept of randomness by means of computati...
Modern Computation and Information theories have had significant impact on science in the 20th centu...
AbstractComputability theory concerns information with a causal–typically algorithmic–structure. As ...
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We e...
All science is founded on the assumption that the physical universe is ordered. Our aim is to challe...
When a physicist writes down equations, or formulates a theory in any other terms, he usually means...
Most of our knowledge about a physical world comes from physical induction: if a hypothesis is confi...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
Compared to the traditionally close rela-tionship between physics and mathe-matics, an exchange of i...
Computer science and physics have been closely linked since the birth of modern computing. In recent...
Computation as a mechanical reality is young - almost exactly seventy years of age - and yet the spi...
Cette thèse explore des aspects du monde naturel par la lentille de l'information algorithmique. La ...
This book is the first one that provides a solid bridge between algorithmic information theory and s...
Can we use some so-far-unused physical phenomena to compute something that usual computers cannot? R...
Several researchers, including M. Gell-Mann, argue that the notion of Kolmogorov complexity, develop...
The book is intended to explain the larger and intuitive concept of randomness by means of computati...
Modern Computation and Information theories have had significant impact on science in the 20th centu...
AbstractComputability theory concerns information with a causal–typically algorithmic–structure. As ...
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We e...
All science is founded on the assumption that the physical universe is ordered. Our aim is to challe...
When a physicist writes down equations, or formulates a theory in any other terms, he usually means...
Most of our knowledge about a physical world comes from physical induction: if a hypothesis is confi...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
Compared to the traditionally close rela-tionship between physics and mathe-matics, an exchange of i...
Computer science and physics have been closely linked since the birth of modern computing. In recent...
Computation as a mechanical reality is young - almost exactly seventy years of age - and yet the spi...
Cette thèse explore des aspects du monde naturel par la lentille de l'information algorithmique. La ...
This book is the first one that provides a solid bridge between algorithmic information theory and s...
Can we use some so-far-unused physical phenomena to compute something that usual computers cannot? R...
Several researchers, including M. Gell-Mann, argue that the notion of Kolmogorov complexity, develop...
The book is intended to explain the larger and intuitive concept of randomness by means of computati...
Modern Computation and Information theories have had significant impact on science in the 20th centu...
AbstractComputability theory concerns information with a causal–typically algorithmic–structure. As ...