Uncomputability: the problem of induction internalized

Abstract

I show that a version of Ockham’s razor (a preference for simple answers) is advantageous in both domains when infallible inference is infeasible. A familiar response to the empirical problem..

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-12-22

Downloads
64 (#326,432)

6 months
8 (#546,836)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A new solution to the puzzle of simplicity.Kevin T. Kelly - 2007 - Philosophy of Science 74 (5):561-573.
Logical Dialogues with Explicit Preference Profiles and Strategy Selection.Emmanuel Genot & Justine Jacot - 2017 - Journal of Logic, Language and Information 26 (3):261-291.
Semantics of Information as Interactive Computation.Gordana Dodig-Crnkovic - 2008 - Proceedings of the Fifth International Workshop on Philosophy and Informatics 2008.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references