David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
We argue that uncomputability and classical scepticism are both re ections of inductive underdetermination, so that Church's thesis and Hume's problem ought to receive equal emphasis in a balanced approach to the philosophy of induction. As an illustration of such an approach, we investigate how uncomputable the predictions of a hypothesis can be if the hypothesis is to be reliably investigated by a computable scienti c method.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Kevin T. Kelly & Clark Glymour (1992). Inductive Inference From Theory Laden Data. Journal of Philosophical Logic 21 (4):391 - 444.
Paulo Sousa (2009). On Testing the 'Moral Law'. Mind and Language 24 (2):209-234.
Kevin T. Kelly (1991). Reichenbach, Induction, and Discovery. Erkenntnis 35 (1-3):123 - 149.
Oliver Schulte, Formal Learning Theory. Stanford Encyclopedia of Philosophy.
Kevin T. Kelly, Oliver Schulte & Cory Juhl (1997). Learning Theory and the Philosophy of Science. Philosophy of Science 64 (2):245-267.
Added to index2009-01-28
Total downloads2 ( #372,165 of 1,139,956 )
Recent downloads (6 months)1 ( #165,020 of 1,139,956 )
How can I increase my downloads?