Skip to main content

Quantum Experiments Can Test Mathematical Undecidability

  • Conference paper
Unconventional Computing (UC 2008)

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

Included in the following conference series:

  • 465 Accesses

Abstract

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, within this axiomatic system. I will show that certain mathematical propositions can be encoded in quantum states and truth values of the propositions can be tested in quantum measurements. I will then show that whenever a proposition is undecidable within the system of axioms encoded in the state, the measurement associated with the proposition gives random outcomes. This suggests a view according to which randomness in quantum mechanics is of irreducible nature.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
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. Barrow, J.D.: Gödel and Physics. In: Horizons of Truth, Kurt Gödel Centenary Meeting, Vienna, April 27-29 (2006) arXiv:physics/0612253

    Google Scholar 

  2. Calude, C.S., Stay, M.A.: Int. J. Theor. Phys. 44, 1053–1065 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Svozil, K.: Phys. Lett. A 143, 433–437 (1990)

    Article  MathSciNet  Google Scholar 

  4. Calude, C.S., Svozil, K. (2006) arXiv:quant-ph/0611029

    Google Scholar 

  5. Chaitin, G.J.: Int. J. Theor. Phys. 21, 941–954 (1982)

    Article  MathSciNet  Google Scholar 

  6. Calude, C.S., Jürgensen, H.: Appl. Math. 35, 1–15 (2005)

    MATH  Google Scholar 

  7. Paterek, T., Dakić, B., Brukner, Č. (2008) arXiv:0804.2193

    Google Scholar 

  8. Bandyopadhyay, S., et al.: Algorithmica 34, 512 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kochen, S., Specker, E.P.: J. Math. Mech. 17, 59 (1967)

    MATH  MathSciNet  Google Scholar 

  10. Bell, J.: Physics 1, 195 (1964)

    Google Scholar 

  11. Zeilinger, A.: Found. Phys. 29, 631–643 (1999)

    Article  MathSciNet  Google Scholar 

  12. Paterek, T., Prevedel, R., Kofler, J., Klimek, P., Aspelmeyer, M., Zeilinger, A., Brukner, Č. (submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Cristian S. Calude José Félix Costa Rudolf Freund Marion Oswald Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brukner, Č. (2008). Quantum Experiments Can Test Mathematical Undecidability. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds) Unconventional Computing. UC 2008. Lecture Notes in Computer Science, vol 5204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85194-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85193-6

  • Online ISBN: 978-3-540-85194-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics