Physical limits of inference

Abstract We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference devices”. We present a set of existence and impossibility results concerning inference devices. These results hold independent of the precise physical laws governing our universe. In a limited sense, the impossibility results establish that Laplace was wrong to claim that even in a classical, non-chaotic universe the future can be unerringly predicted, given sufficient knowledge of the present. Alternatively, these impossibility results can be viewed as a non-quantum-mechanical “uncertainty principle”. The mathematics of inference devices has close connections to the mathematics of Turing Machines (TMs). In particular, the impossibility results for inference devices are similar to the Halting theorem for TMs. Furthermore, one can define an analog of Universal TMs (UTMs) for inference devices. We call those analogs “strong inference devices”. We use strong inference devices to define the “inference complexity” of an inference task, which is the analog of the Kolmogorov complexity of computing a string. A task-independent bound is derived on how much the inference complexity of an inference task can differ for two different inference devices. This is analogous to the “encoding” bound governing how much the Kolmogorov complexity of a string can differ between two UTMs used to compute that string. However no universe can contain more than one strong inference device. So whereas the Kolmogorov complexity of a string is arbitrary up to specification of the UTM, there is no such arbitrariness in the inference complexity of an inference task. We informally discuss the philosophical implications of these results, e.g., for whether the universe “is” a computer. We also derive some graph-theoretic properties governing any set of multiple inference devices. We also present an extension of the framework to address physical devices used for control. We end with an extension of the framework to address probabilistic inference.

[1]  Rolf Landauer,et al.  Dissipation and noise immunity in computation and communication , 1988, Nature.

[2]  James B. Hartle,et al.  Computability and physical theories , 1986, 1806.09237.

[3]  J. Rogers Chaos , 1876 .

[4]  Seth Lloyd,et al.  Information measures, effective complexity, and total information , 1996 .

[5]  Rolf Landauer,et al.  Reversible Computing and Physical Law , 1992 .

[6]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[7]  Gurindar S. Sohi,et al.  Memory systems , 1996, CSUR.

[8]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[9]  Michael C. Mackey,et al.  Chaos, Fractals, and Noise , 1994 .

[10]  Simon Kochen,et al.  The Free Will Theorem , 2006 .

[11]  H. Zeh On the interpretation of measurement in quantum theory , 1970 .

[12]  Touchette,et al.  Information-theoretic limits of control , 1999, Physical review letters.

[13]  D. Mackay III.—ON THE LOGICAL INDETERMINACY OF A FREE CHOICE , 1960 .

[14]  H. Everett "Relative State" Formulation of Quantum Mechanics , 1957 .

[15]  Max Tegmark The Mathematical Universe , 2007, Foundations of Physics.

[16]  Jorge Berger Szilard's demon revisited , 1990 .

[17]  P. Malliavin Infinite dimensional analysis , 1993 .

[18]  James E. Tomberlin,et al.  On the Plurality of Worlds. , 1989 .

[19]  David Pines,et al.  Emerging Syntheses In Science , 1988 .

[20]  David H. Wolpert,et al.  Memory systems, computation, and the second law of thermodynamics , 1992 .

[21]  A. F. Foundations of Physics , 1936, Nature.

[22]  M. W. Shields An Introduction to Automata Theory , 1988 .

[23]  Jürgen Schmidhuber,et al.  A Computer Scientist's View of Life, the Universe, and Everything , 1999, Foundations of Computer Science: Potential - Theory - Cognition.

[24]  G. Ellis,et al.  Universe or Multiverse , 2009 .

[25]  October I Physical Review Letters , 2022 .

[26]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[27]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[28]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[29]  W. Zurek Decoherence, einselection, and the quantum origins of the classical , 2001, quant-ph/0105127.

[30]  R. Feynman Quantum mechanical computers , 1986 .

[31]  M. B. Pour-El,et al.  Noncomputability in models of physical phenomena , 1982 .

[33]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[34]  P.C.W. Davies The implications of a cosmological information bound for complexity, quantum information and the nature of physical law , 2007 .

[35]  J. Butterfield The End of Time , 2001, gr-qc/0103055.

[36]  Zhukovskii,et al.  Ab initio modeling of metal adhesion on oxide surfaces with defects , 2000, Physical review letters.

[37]  Keijo Ruohonen Decidability and complexity of event detection problems for ODEs , 1997 .

[38]  S. Lloyd Ultimate physical limits to computation , 1999, Nature.

[39]  R. Toral,et al.  Fluctuation and Noise Letters , 2007 .

[40]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[41]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[42]  Robert J. Aumann,et al.  Interactive epistemology II: Probability , 1999, Int. J. Game Theory.

[43]  David H Wolpert,et al.  Computational capabilities of physical systems. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  L. Smolin,et al.  The Life of the Cosmos , 1997 .

[45]  M. MAOKAY III . — ON THE LOGICAL INDETERMINACY OF A FREE CHOICE , 2005 .

[46]  R. J. Joenk,et al.  IBM journal of research and development: information for authors , 1978 .

[47]  N. Costa,et al.  Undecidability and incompleteness in classical mechanics , 1991 .

[48]  T. GOLD Multiple Universes , 1973, Nature.

[49]  Ofi rNw8x'pyzm,et al.  The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions , 2002 .

[50]  Robert John Ackermann,et al.  Postscript to The Logic of Scientific Discovery , 1984 .

[51]  W. H. Zurek,et al.  Thermodynamic cost of computation, algorithmic complexity and the information metric , 1989, Nature.

[52]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[53]  R. Aumann,et al.  Epistemic Conditions for Nash Equilibrium , 1995 .

[54]  Max Tegmark,et al.  Multiple universes, cosmic coincidences, and other dark matters , 2004 .

[55]  Kanter Undecidability principle and the uncertainty principle even for classical systems. , 1990, Physical review letters.

[56]  J. Urry Complexity , 2006, Interpreting Art.