Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Addison, J. (1955). “Analogies in the Borel, Lusin, and Kleene Hierarchies,” Bulletin of the American Mathematics Society 61: 171–172.
Angluin, D. and Smith, C. “A survey of inductive inference: Theory and methods.” Computing Surveys 15:237–289.
Case, J. and Smith, C. (1983) “Comparison of Identification Criteria for Machine Inductive Inference,” Theoretical Computer Science 25: 193–220.
Cutland, N.J. (1986). Computability: An introduction to recursive function theory. Cambridge: Cambridge University Press.
Gaifman, H. and M. Snir (1982). “Probabilities Over Rich Languages, Testing and Randomness,” Journal of Symbolic Logic 47: 495–548.
Gärdenfors, P. (1988). Knowledge In Flux: modeling the dynamics of epistemic states. Cambridge: MIT Press.
Garber, D. (1983) “Old Evidence and Logical Omniscience in Bayesian Confirmation Theory,” in Testing Scientific Theories: Minnesota Studies in the Philosophy of Science, vol. 10, ed. J. Earman. Minneapolis: University of Minnesota Press.
Gold, E.M. (1965). “Limiting Recursion,” Journal of Symbolic Logic 30: 27–48.
Hàjek, P. (1978). “Experimental Logics and Π0 3 Theories,” Journal of Symbolic Logic 42: 515–522.
Hinman, P.G. (1978). Recursion-Theoretic Hierarchies. New York: Prentice-Hall.
Hume, D. (1984). An Inquiry Concerning Human Understanding, ed. C. Hendell. New York: Bobbs-Merrill.
James, W. (1948) “The Will To Believe,” Essays in Pragmatism. ed. A. Castell. New York: Collier.
Kelly, K. (1995). The Logic of Reliable Inquiry. Oxford: Oxford University Press.
Kelly, K. and Schulte, O. (1995) “The Computable Testability of Theories Making Uncomputable Predictions,” Erkenntnis. 43:29–66.
Kugel, P. (1977). “Induction, Pure and Simple,” Information and Control 33:276–336.
Levi, I. (1990). “Rationality Unbound,” in Acting and Reflecting, ed. W. Sieg. Dordrecht: Kluwer.
Moschavakis, Y. (1980). Descriptive Set Theory. Amsterdam: North Holland.
Osherson, D., Stob, M. and Weinstein, S (1986). Systems That Learn. Cambridge, Mass: MIT Press.
Peirce, C.S. (1958). Charles S. Peirce: Selected Writings, ed. P. Wiener. New York: Dover.
Popper, K. (1968). The Logic Of Scientific Discovery. New York: Harper.
Putnam, H. (1963). “‘Degree of Confirmation’ and Inductive Logic,” In The Philosophy of Rudolph Carnap, ed. A. Schilpp. La Sall, Ill.: Open Court.
Putnam, H. (1965). “Trial and Error Predicates and a Solution to a Problem of Mostowski,” Journal of Symbolic Logic 30: 49–57.
Reichenbach, H.(1949). The Theory of Probability. London: Cambridge University Press.
Rogers, H. (1987). The Theory of Recursive Functions and Effective Computability. Cambridge: MIT Press.
Sextus Empiricus (1985). Selections from the Major Writings on Scepticism, Man and God, ed. P. Hallie, trans. S. Etheridge. Indianapolis: Hackett.
Sieg, W.(1994). “Mechanical Procedures and Mathematical Experience,” in Mathematics and Mind, ed. A. George. Oxford: Oxford University Press.
Turing, A. (1936). “On Computable Numbers, with an Application to the Entscheidungsproblem,” London Mathematics Society 42: 230–265.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kelly, K.T., Schulte, O. (1997). Church’s Thesis and Hume’s Problem. In: Dalla Chiara, M.L., Doets, K., Mundici, D., van Benthem, J. (eds) Logic and Scientific Methods. Synthese Library, vol 259. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0487-8_9
Download citation
DOI: https://doi.org/10.1007/978-94-017-0487-8_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4786-1
Online ISBN: 978-94-017-0487-8
eBook Packages: Springer Book Archive