Fundamental As Fewer Bits

In TAO https://tarxiv.org/tao Volume 2018 https://tarxiv.org/tao.2018 Issue 01 https://tarxiv.org/tao.2018‑01

Bollinger, T., Fundamental As Fewer Bits, TAO Phys. 2018, 0122 (2021). https://doi.org/10.48034/20180122 https://doi.org/10.48034/20180122

Full article (PDF) https://tarxiv.org/tao.2018‑01‑22.pdf BibTex Citation https://tarxiv.org/tao.2018‑01‑22 Bollinger - Fundamental As Fewer Bits.bib.txt

Obsoletes: ob1 https://tarxiv.org/tao.2018‑01‑22.ob1.pdf

Abstract
A physics theory predicts precise experimental results for some set of naturally occurring phenomena. Consequently, every well-formed physics theory is equivalent to a computer program that uses input descriptions of specific experimental setups to generate the outputs expected from those setups. The Kolmogorov complexity (or Kolmogorov minimum) of such a computer program is the program that uses the smallest number of bits to represent the largest possible of such input-output data pairs accurately. The principle of concise prediction asserts that the theory whose program length is shortest for a given set of experimental inputs and results is the one most likely to lead to deeper insights and new physics.

Apabistia Press mailto:terrybollinger@gmail.com