Uncomputability: the problem of induction internalized


Authors
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..
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,182
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

A New Solution to the Puzzle of Simplicity.Kevin 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

Similar books and articles

A Material Theory of Induction.John D. Norton - 2003 - Philosophy of Science 70 (4):647-670.
On Not Changing the Problem: A Reply to Howson.Daniel Steel - 2011 - International Studies in the Philosophy of Science 25 (3):285 - 291.
The Last Word on Induction?Colin Howson - 1991 - Erkenntnis 34 (1):73 - 82.
Explanationist Aid for the Theory of Inductive Logic.Michael Huemer - 2009 - British Journal for the Philosophy of Science 60 (2):345-375.
On Probabilism and Induction.John Hosack - 1991 - Topoi 10 (2):227-229.
Observation and Induction.Theodore J. Everett - 2010 - Logos and Episteme 1 (2):303-324.
The Problem of Induction.Gilbert Harman & Sanjeev R. Kulkarni - 2006 - Philosophy and Phenomenological Research 72 (3):559-575.
A Brief Critique of Pure Hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.

Analytics

Added to PP index
2010-12-22

Total views
40 ( #227,914 of 2,289,448 )

Recent downloads (6 months)
2 ( #587,611 of 2,289,448 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature