References
Gaifman, H. and M. Snir: 1982, ‘Probabilities over Rich Languages, Testing and Randomness’,Journal of Symbolic Logic 47, 495–548.
Gold, E. M.: 1965, ‘Limiting Recursion’,Journal of Symbolic Logic 30, 27–48.
Hinman, P. G.: 1978,Recursion-Theoretic Hierarchies, New York: Springer.
Kelly, K.: 1991, ‘Reichenbach, Induction, and Discovery’,Erkenntnis 35, 123–149.
Kelly, K.: 1993, ‘Learning Theory and Descriptive Set Theory’,Journal of Logic and Computation,3, 27–45.
Kelly, K.: 1995,The Logic of Reliable Inquiry, forthcoming, New York: Oxford University Press.
Kelly, K. and C. Glymour: 1992, ‘Thoroughly Modern Meno’, in J. Earman (ed.),Inference, Explanation, and other Frustrations, Berkeley: University of California Press, pp. 3–22.
Osherson, D., M. Stob, and S. Weinstein: 1986,Systems that Learn, Cambridge: MIT Press.
Peirce, C. S.: 1935,Collected Papers of Charles Sanders Peirce, C. Hartshorne and P. Weiss (eds).
Popper, K. (1968),The Logic of Scientific Discovery, New York, Harper.
Pour-El, M. and J. Richards: 1980,Computability in Analysis and Physics, New York, Springer.
Putnam, H.: 1963, ‘“Degree of Confirmation” and Inductive Logic’, in A. Schilpp (ed.),The Philosophy of Rudolph Carnap, Lasalle, Illinois: 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 & God, P. Hallie (ed.), S. Etheridge, trans. Indianapolis, Hackett.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kelly, K.T., Schulte, O. The computable testability of theories making uncomputable predictions. Erkenntnis 43, 29–66 (1995). https://doi.org/10.1007/BF01131839
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01131839