Probabilistic Proofs and Transferability
In a series of papers, Don Fallis points out that although mathematicians are generally unwilling to accept merely probabilistic proofs, they do accept proofs that are incomplete, long and complicated, or partly carried out by computers. He argues that there are no epistemic grounds on which probabilistic proofs can be rejected while these other proofs are accepted. I defend the practice by presenting a property I call 'transferability', which probabilistic proofs lack and acceptable proofs...[Show more]
|Collections||ANU Research Publications|
|01_Easwaran_Probabilistic_Proofs_and_2009.pdf||74.83 kB||Adobe PDF||Request a copy|
|02_Easwaran_Probabilistic_Proofs_and_2009.pdf||119.12 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.