This article argues that a successful answer to Hume's problem of induction can be developed from a sub-genre of philosophy of science known as formal learning theory. One of the central concepts of formal learning theory is logical reliability: roughly, a method is logically reliable when it is assured of eventually settling on the truth for every sequence of data that is possible given what we know. I show that the principle of induction (PI) is necessary and sufficient for logical (...) reliability in what I call simple enumerative induction. This answer to Hume's problem rests on interpreting PI as a normative claim justified by a non-empirical epistemic means-ends argument. In such an argument, a rule of inference is shown by mathematical or logical proof to promote a specified epistemic end. Since the proof concerning PI and logical reliability is not based on inductive reasoning, this argument avoids the circularity that Hume argued was inherent in any attempt to justify PI. (shrink)

This paper explains what’s wrong with a Hume-inspired argument for skepticism about induction. Hume’s argument takes as a premise that inductive reasoning presupposes that the future will resemble the past. I explain why that claim is not plausible. The most plausible premise in the vicinity is that inductive reasoning from E to H presupposes that if E then H. I formulate and then refute a skeptical argument based on that premise. Central to my response is a psychological explanation for how (...) people judge that if E then H without realizing that they thereby settled the matter rationally. (shrink)

This paper discusses recent attempts to solve the problem of induction. Two broad strategies to escape Hume's fork can be distinguished. The first tries to localize the justification of specific inductions in uncontroversial empirical knowledge, e.g.mundane scientific knowledge (J. D. Norton) or perception (M. Lange). I argue that related attempts to (dis)solve the problem fail. The second strategy tries to put forward an argument in favor of induction. As a discussion of work by R. White shows, this argument can barely (...) prove that induction is reliable or at least not unreliable. But D. Steel, F. Huber and G. Schurz could show that enumerative induction is necessary and sufficient for a certain epistemic goal or optimal in a certain sense. These proofs, however, only solve the problem of induction if the goal or a certain standard has priority over the avoidance of error. This suggests that the difficulties to justify induction do not so much derive from Hume's fork, but rather from a plurality of sensible epistemic goals that can conflict with each other. (shrink)