Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

GÖDEL’S INCOMPLETENESS THEOREM MAKES THE QUANTUM DOUBLE SLIT EXPERIMENT UNDECIDABLE

View through CrossRef
Kurt Gödel’s incompleteness theorem refers to incompleteness in the sense that there are always statements which can be formulated within a formal system, but which re-main unproved within the system. Gödel’s theorem was first connected with the theory of computability by Alan Turing. Until recently, the inconsistency that Gödel’s theo-rem tackle has not been directly shown to correspond to any physical phenomenon. A recent article showed how to apply Gödel’s theorem in the context of many-body quan-tum mechanical calculations. Even so, it is still not known whether it can be applied to the most primitive quantum physical phenomena. In the present study, we used Gödel’s incompleteness theorem in the case of the quantum double-slit experiment by applying a proof of Turing machine’s halting problem. In addition, we made an analogy between Gödel’s theorem (and Church - Turing theses of computability), and quantum compu-ting by extrapolating the term “computation” as low as to the single-quantum level.
Center for Open Science
Title: GÖDEL’S INCOMPLETENESS THEOREM MAKES THE QUANTUM DOUBLE SLIT EXPERIMENT UNDECIDABLE
Description:
Kurt Gödel’s incompleteness theorem refers to incompleteness in the sense that there are always statements which can be formulated within a formal system, but which re-main unproved within the system.
Gödel’s theorem was first connected with the theory of computability by Alan Turing.
Until recently, the inconsistency that Gödel’s theo-rem tackle has not been directly shown to correspond to any physical phenomenon.
A recent article showed how to apply Gödel’s theorem in the context of many-body quan-tum mechanical calculations.
Even so, it is still not known whether it can be applied to the most primitive quantum physical phenomena.
In the present study, we used Gödel’s incompleteness theorem in the case of the quantum double-slit experiment by applying a proof of Turing machine’s halting problem.
In addition, we made an analogy between Gödel’s theorem (and Church - Turing theses of computability), and quantum compu-ting by extrapolating the term “computation” as low as to the single-quantum level.

Related Results

A Missing Link: The Double-Slit Experiment and Quantum Entanglement
A Missing Link: The Double-Slit Experiment and Quantum Entanglement
This article reconsiders the double-slit experiment by establishing a new type of relationship between it and the concept of entanglement. While the role of entanglement in the dou...
Advanced frameworks for fraud detection leveraging quantum machine learning and data science in fintech ecosystems
Advanced frameworks for fraud detection leveraging quantum machine learning and data science in fintech ecosystems
The rapid expansion of the fintech sector has brought with it an increasing demand for robust and sophisticated fraud detection systems capable of managing large volumes of financi...
Rosser Systems
Rosser Systems
Our first proof of the incompleteness of P.A. was based on the assumption that P.A. is correct. Gödel’s proof of the last chapter was based on the metamathematically weaker assumpt...
Advancements in Quantum Computing and Information Science
Advancements in Quantum Computing and Information Science
Abstract: The chapter "Advancements in Quantum Computing and Information Science" explores the fundamental principles, historical development, and modern applications of quantum co...
Quantum Computing and Quantum Information Science
Quantum Computing and Quantum Information Science
Abstract: Quantum Computing and Quantum Information Science offers a comprehensive, interdisciplinary exploration of the mathematical principles, computational models, and engineer...
The General Idea Behind Gödel’s Proof
The General Idea Behind Gödel’s Proof
In the next several chapters we will be studying incompleteness proofs for various axiomatizations of arithmetic. Gödel, 1931, carried out his original proof for axiomatic set theo...

Back to Top