Skip to main content
Log in

The computable testability of theories making uncomputable predictions

Erkenntnis Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Gaifman, H. and M. Snir: 1982, ‘Probabilities over Rich Languages, Testing and Randomness’,Journal of Symbolic Logic 47, 495–548.

    Google Scholar 

  • Gold, E. M.: 1965, ‘Limiting Recursion’,Journal of Symbolic Logic 30, 27–48.

    Google Scholar 

  • Hinman, P. G.: 1978,Recursion-Theoretic Hierarchies, New York: Springer.

    Google Scholar 

  • Kelly, K.: 1991, ‘Reichenbach, Induction, and Discovery’,Erkenntnis 35, 123–149.

    Google Scholar 

  • Kelly, K.: 1993, ‘Learning Theory and Descriptive Set Theory’,Journal of Logic and Computation,3, 27–45.

    Google Scholar 

  • Kelly, K.: 1995,The Logic of Reliable Inquiry, forthcoming, New York: Oxford University Press.

    Google Scholar 

  • 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.

    Google Scholar 

  • Osherson, D., M. Stob, and S. Weinstein: 1986,Systems that Learn, Cambridge: MIT Press.

    Google Scholar 

  • 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.

    Google Scholar 

  • Pour-El, M. and J. Richards: 1980,Computability in Analysis and Physics, New York, Springer.

    Google Scholar 

  • Putnam, H.: 1963, ‘“Degree of Confirmation” and Inductive Logic’, in A. Schilpp (ed.),The Philosophy of Rudolph Carnap, Lasalle, Illinois: Open Court.

    Google Scholar 

  • Putnam, H.: 1965, ‘Trial and Error Predicates and a Solution to a Problem of Mostowski’,Journal of Symbolic Logic 30, 49–57.

    Google Scholar 

  • Reichenbach, H.: 1949,The Theory of Probability, London, Cambridge University Press.

    Google Scholar 

  • Rogers, H.: 1987,The Theory of Recursive Functions and Effective Computability, Cambridge, MIT Press.

    Google Scholar 

  • Sextus Empiricus: 1985,Selections from the Major Writings on Scepticism, Man & God, P. Hallie (ed.), S. Etheridge, trans. Indianapolis, Hackett.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01131839

Navigation