English

The Computable Universe Hypothesis

Logic 2013-08-09 v6 Computational Complexity Logic in Computer Science Mathematical Physics math.MP

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.

Keywords

Cite

@article{arxiv.1003.5831,
  title  = {The Computable Universe Hypothesis},
  author = {Matthew P. Szudzik},
  journal= {arXiv preprint arXiv:1003.5831},
  year   = {2013}
}

Comments

33 pages, 0 figures; minor changes

R2 v1 2026-06-21T15:04:32.565Z