Inference Concerning Physical Systems

The question of whether the universe "is" just an information-processing system has been extensively studied in physics. To address this issue, the canonical forms of information processing in physical systems -- observation, prediction, control and memory -- were analyzed in [24]. Those forms of information processing are all inherently epistemological; they transfer information concerning the universe as a whole into a scientist's mind. Accordingly, [24] formalized the logical relationship that must hold between the state of a scientist's mind and the state of the universe containing the scientist whenever one of those processes is successful. This formalization has close analogs in the analysis of Turing machines. In particular, it can be used to define an "informational analog" of algorithmic information complexity. In addition, this formalization allows us to establish existence and impossibility results concerning observation, prediction, control and memory. 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 suffcient knowledge of the present. Alternatively, the impossibility results can be viewed as a non-quantum mechanical "uncertainty principle". Here I present a novel motivation of the formalization introduced in [24] and extend some of the associated impossibility results.

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

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

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

[4]  David H. Wolpert,et al.  Physical limits of inference , 2007, ArXiv.

[5]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

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

[7]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

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

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

[11]  P.-M. Binder,et al.  Philosophy of science: Theories of almost everything , 2008, Nature.

[12]  Stuart A. Aaronson Growth Factor and Receptor Tyrosine Kinases , 2005, Science's STKE.

[13]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

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

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

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

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

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

[19]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

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