Theory of Quantum Computation and Philosophy of Mathematics. Part II

DOI10.12775/LLP.2018.006zbMath1430.68107WikidataQ129959002 ScholiaQ129959002MaRDI QIDQ5215501

Krzysztof Wójtowicz

Publication date: 11 February 2020

Published in: Logic and Logical Philosophy (Search for Journal in Brave)

zbMATH Keywords

quantum computationquasi-empiricismindispensability argumentmathematical realismquantum-assisted proofs

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Quantum computation (81P68) General topics in the theory of computing (68Q01) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Are There Category-Theoretical Explanations of Physical Phenomena? ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics

Uses Software

• kepler98

Cites Work

• Optimisation and mathematical explanation: doing the Lévy walk
• General relativistic hypercomputing and foundation of mathematics
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A proof of the Kepler conjecture
• Relativistic computers and the Turing barrier
• Indispensability and Explanation
• Abstract Expressionism and the Communication Problem
• What Makes a Scientific Explanation Distinctively Mathematical?
• Mathematical Explanation in Science
• The Explanatory Power of Phase Spaces
• The Philosophical Implications of the Four-Color Problem
• Why Do We Prove Theorems?
• Strengths and Weaknesses of Quantum Computing
• Skepticism of quantum computing
• Indexing and Mathematical Explanation
• Quantum speedup of Monte Carlo methods
• Experimental mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item