Theory of quantum computation and philosophy of mathematics. II
DOI10.12775/LLP.2018.006zbMATH Open1430.68107WikidataQ129959002 ScholiaQ129959002MaRDI QIDQ5215501FDOQ5215501
Authors: Krzysztof Wójtowicz
Publication date: 11 February 2020
Published in: Logic and Logical Philosophy (Search for Journal in Brave)
Recommendations
quantum computationindispensability argumentmathematical realismquasi-empiricismquantum-assisted proofs
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Philosophy of mathematics (00A30) General topics in the theory of computing (68Q01)
Cites Work
- A proof of the Kepler conjecture
- Title not available (Why is that?)
- General relativistic hypercomputing and foundation of mathematics
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Strengths and Weaknesses of Quantum Computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Explanation in Science
- The Explanatory Power of Phase Spaces
- Why Do We Prove Theorems?
- Title not available (Why is that?)
- Cannonballs and honeycombs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimisation and mathematical explanation: doing the Lévy walk
- Indexing and mathematical explanation
- What Makes a Scientific Explanation Distinctively Mathematical?
- Relativistic computers and the Turing barrier
- Indispensability and Explanation
- Abstract Expressionism and the Communication Problem
- The Philosophical Implications of the Four-Color Problem
- Quantum speedup of Monte Carlo methods
- Skepticism of quantum computing
- Experimental mathematics
- Theory of quantum computation and philosophy of mathematics. I
Cited In (5)
Uses Software
This page was built for publication: Theory of quantum computation and philosophy of mathematics. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215501)