Church’s Thesis and Hume’s Problem

We argue that uncomputability and classical scepticism are both reflections 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 scientific method.

[1]  Peter Kugel,et al.  Induction, Pure and Simple , 1977, Inf. Control..

[2]  J. A. Mourant.  The Philosophy of Rudolph Carnap , 1965 .

[3]  Alexander George.  Mathematics and mind , 1994 .

[4]  Wilfried Sieg.  Acting and Reflecting , 1989 .

[5]  Marc Snir,et al.  Probabilities over rich languages, testing and randomness , 1982, Journal of Symbolic Logic.

[6]  Y. Moschovakis.  Descriptive Set Theory , 1980 .

[7]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[8]  D. R. Morrison,et al.  Selections from the major writings on scepticism, man, & God , 1985 .

[9]  E. Mark Gold,et al.  Limiting recursion , 1965, Journal of Symbolic Logic.

[10]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[11]  L. M. M.-T..  Theory of Probability , 1929, Nature.

[12]  K. Popper,et al.  The Logic of Scientific Discovery , 1960 .

[13]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[14]  Theodore Hailperin,et al.  An incorrect theorem , 1965, Journal of Symbolic Logic.

[15]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[16]  W. James,et al.  The Will to Believe , 1997, Arguing About Knowledge.

[17]  Kevin T. Kelly.  The Logic of Reliable Inquiry , 1996 .

[18]  Petr Hájek,et al.  Experimental logics and Π30 theories , 1977, Journal of Symbolic Logic.

[19]  H. Putnam.  Mathematics, Matter and Method: ‘Degree of confirmation’ and inductive logic , 1979 .

[20]  Daniel Garber,et al.  Old Evidence and Logical Omniscience in Bayesian Confirmation Theory , 1983 .

[21]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[22]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[23]  Hilary Putnam,et al.  Trial and error predicates and the solution to a problem of Mostowski , 1965, Journal of Symbolic Logic.

[24]  William James,et al.  Essays in Pragmatism , 1970 .

[25]  H. E. Rose.  COMPUTABILITY-AN INTRODUCTION TO RECURSIVE FUNCTION THEORY , 1981 .

[26]  H. Jeffreys.  A Treatise on Probability , 1922, Nature.

[27]  Kevin T. Kelly,et al.  The computable testability of theories making uncomputable predictions , 1995 .

[28]  Wilfried Sieg,et al.  Mechanical Procedures and Mathematical Experience , 1991 .