Skip to main content

Inference Concerning Physical Systems

  • Conference paper
Programs, Proofs, Processes (CiE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6158))

Included in the following conference series:

Abstract

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 sufficient 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aaronson, S.: quant-ph/0502072 (2005)

    Google Scholar 

  2. Bennett, C.H.: International Journal of Theoretical Physics 21 (1982)

    Google Scholar 

  3. Bennett, C.H.: IBM Journal of Research and Development 17, 525–532 (1973)

    Google Scholar 

  4. Bennett, C.H.: Emerging Syntheses in Science. In: Pines, D. (ed.), p. 297. Addison Wesley, Reading (1987)

    Google Scholar 

  5. Binder, P.: Theories of almost everything. Nature 455, 884–885 (2008)

    Article  Google Scholar 

  6. Collins, G.P.: Impossible inferences, pp. 12–21. Scientific American, Singapore (2009)

    Google Scholar 

  7. Cover, T., Thomas, J.: Elements of information theory. Wiley-Interscience, New York (1991)

    Book  MATH  Google Scholar 

  8. Feynman, R.: Foundations of Physics 16, 507 (1986)

    Google Scholar 

  9. Fredkin, E., Toffoli, T.: International Journal of Theoretical Physics 21, 219 (1982)

    Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison Wesley, Reading (1979)

    MATH  Google Scholar 

  11. Landauer, R.: IBM Journal of Research and Development 5, 183 (1961)

    Google Scholar 

  12. Landauer, R.: Nature 335, 779–784 (1988)

    Google Scholar 

  13. Laplace, S.P.: Philosophical essays on probabilities, Dover (1985), Originally in 1825; Translated by Emory, F.L., Truscott, F.W.

    Google Scholar 

  14. Lloyd, S.: Nature 406, 1047 (2000)

    Google Scholar 

  15. Lloyd, S.: Programming the universe. Random House (2006)

    Google Scholar 

  16. Mackay, D.J.C.: Information theory, inference, and learning algorithms. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  17. MacKay, D.M.: On the logical indeterminacy of a free choice. Mind, New Series 69(273), 31–40 (1960)

    Article  Google Scholar 

  18. Moore, C.: Physical Review Letters 64, 2354–2357 (1990)

    Google Scholar 

  19. Popper, K.: The impossibility of self-prediction, The Open Universe: From the Postscript to the Logic of Scientific Discovery, p. 68. Routledge, New York (1988)

    Google Scholar 

  20. Pour-El, M., Richards, I.: International Journal of Theoretical Physics 21, 553 (1982)

    Google Scholar 

  21. Wolfram, S.: A new kind of science. Wolfram Media, Inc. (2002)

    Google Scholar 

  22. Wolpert, D.: Memory systems, computation, and the second law of thermodynamics. International Journal of Theoretical Physics 31, 743–785 (1992); Revised version available from author

    Article  MATH  Google Scholar 

  23. Wolpert, D.: Computational capabilities of physical systems. Physical Review E 65, 016128 (2001)

    Article  MathSciNet  Google Scholar 

  24. Wolpert, D.H.: Physical limits of inference. Physica D 237, 1257–1281 (2008), More recent version at http://arxiv.org/abs/0708.1362

  25. Zurek, W.: Nature 341, 119 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolpert, D.H. (2010). Inference Concerning Physical Systems. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds) Programs, Proofs, Processes. CiE 2010. Lecture Notes in Computer Science, vol 6158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13962-8_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13962-8_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13961-1

  • Online ISBN: 978-3-642-13962-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics