Randomized Arguments are Transferable
- 7 September 2009
- journal article
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 17 (3) , 363-368
Abstract
Easwaran has given a definition of transferability and argued that, under this definition, randomized arguments are not transferable. I show that certain aspects of his definition are not suitable for addressing the underlying question of whether or not there is an epistemic distinction between randomized and deductive arguments. Furthermore, I demonstrate that for any suitable definition, randomized arguments are in fact transferable.Keywords
This publication has 4 references indexed in Scilit:
- Probabilistic Proofs and TransferabilityPhilosophia Mathematica, 2008
- The Reliability of Randomized AlgorithmsThe British Journal for the Philosophy of Science, 2000
- The Epistemic Status of Probabilistic ProofThe Journal of Philosophy, 1997
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980