The computable universe hypothesis
From MaRDI portal
Publication:4907937
Abstract: When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, a model which features non-discrete continuous motion, and probabilistic models such as radioactive decay. We show how computable physical models on effective topological spaces can be formulated using the theory of type-two effectivity (TTE). Various common operations on computable physical models are described, such as the operation of coarse-graining and the formation of statistical ensembles. The definition of a computable physical model also allows for a precise formalization of the computable universe hypothesis--the claim that all the laws of physics are computable.
Recommendations
- The computational status of physics
- Church's thesis and physical computation
- Is Turing's thesis the consequence of a more general physical principle?
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- The physical Church-Turing thesis: modest or bold?
Cited in
(8)- Computing the uncomputable; or, the discrete charm of second-order simulacra
- The subjective computable universe
- Physical Systems as Constructive Logics
- Clockwork Rebooted: Is the Universe a Computer?
- Computational universes
- Semantics of computable physical models
- Estimates of universal computational capacity to the present
- A holographic bound on the total number of computations in the visible universe
This page was built for publication: The computable universe hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907937)