Quantum Experiments Can Test Mathematical Undecidability

DOI10.1007/978-3-540-85194-3_1zbMath1166.81305MaRDI QIDQ3543325

Časlav Brukner

Publication date: 2 December 2008

Published in: Unconventional Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85194-3_1

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

81P15: Quantum measurement theory, state operations, state preparations

03B25: Decidability of theories and sets of sentences

00A35: Methodology of mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Gödel's theorem and information
• A new proof for the existence of mutually unbiased bases
• Is complexity a source of incompleteness?
• From Heisenberg to Gödel via Chaitin