Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Randomness and determinism in the interplay between the continuum and the discrete†
Mathematical Structures in Computer Science
Information and Computation
What is turing's comparison between mechanism and writing worth?
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Incomputability in physics and biology
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
Computability originated from Logic and followed the original path proposed by the founding fathers of the modern foundational analysis of Mathematics (Frege, Hilbert). This theoretical path departed in principle from the contemporary renewed relations between Geometry and Physics. In particular, the key issue of physical measure, as our only access to "reality", is not part of its theoretical frame, in contrast to Physics, since Poincaré, Planck and Einstein. Computability though, by its fine analysis of undecidability, provides a very useful tool for the investigation of "unpredictability" in Physics. Unpredictability coincides with physical randomness, in classical and quantum frames. And an understanding of randomness turns out to be a key component of intelligibility in Physics.