Quantum Experiments Can Test Mathematical Undecidability

DOI10.1007/978-3-540-85194-3_1zbMath1166.81305OpenAlexW1549055730MaRDI 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

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum measurement theory, state operations, state preparations (81P15) Decidability of theories and sets of sentences (03B25) Methodology of mathematics (00A35)

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum Experiments Can Test Mathematical Undecidability