Quantum experiments can test mathematical undecidability

Publications: Contribution to bookContribution to proceedingsPeer Reviewed

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.
Original languageEnglish
Title of host publicationUnconventional Computing
EditorsCS Calude, JF Costa, R Freund, M Oswald, G Rozenberg
Place of PublicationBERLIN
PublisherSpringer-Verlag Berlin
Pages1-5
Number of pages5
ISBN (Print)978-3-540-85193-6
Publication statusPublished - 2008
Event7th International Conference on Unconventional Computation (UC 2008) - TU WIen, Wien, Austria
Duration: 25 Aug 200828 Aug 2008

Publication series

SeriesLecture Notes in Computer Science
Volume5204
ISSN0302-9743

Conference

Conference7th International Conference on Unconventional Computation (UC 2008)
Abbreviated titleUC 2008
Country/TerritoryAustria
CityWien
Period25/08/0828/08/08

Austrian Fields of Science 2012

  • 103025 Quantum mechanics

Keywords

  • MECHANICS
  • GODEL

Fingerprint

Dive into the research topics of 'Quantum experiments can test mathematical undecidability'. Together they form a unique fingerprint.

Cite this