Mathematical proof

DOI10.1080/09720502.2005.10700395MaRDI QIDQ3370569zbMATH OpenOpenAlexFDO

Authors W. S. Curran

Publication date 8 February 2006

Published in Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720502.2005.10700395

zbMATH Keywords

NP-hard problemsformal proofquantum computerTuring machinescomputer proof

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Philosophical and critical aspects of logic and foundations (03A05) Quantum computation (81P68) Methodology of mathematics (00A35) Philosophy of mathematics (00A30)

Recommendations

• Mathematical concepts in computer proofs
• Mathematical proofs in the computer age
• Theory Is Forever
• Proving and programming
• scientific article; zbMATH DE number 733568

Cited in

(10)

• Proof in the time of machines
• Proofs for a price: tomorrow's ultra-rigorous mathematical culture
• Mathematical concepts in computer proofs
• Computerized deconstruction.
• Desperately seeking mathematical proof
• MATHEMATICAL RIGOR AND PROOF
• Mathematical method and proof
• Theory Is Forever
• How reliable is a computer-based proof?
• Spectral representation of some computably enumerable sets with an application to quantum provability

This page was built for publication: Mathematical proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370569)