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

computer proofformal proofNP-hard problemsquantum computerTuring machines

Mathematics Subject Classification ID

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

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)

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

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)