David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
then essentially characterized the hypotheses that mechanical scientists can successfully decide in the limit in terms of arithmetic complexity. These ideas were developed still further by Peter Kugel . In this paper, I extend this approach to obtain characterizations of identification in the limit, identification with bounded mind-changes, and identification in the short run, both for computers and for ideal agents with unbounded computational abilities. The characterization of identification with n mind-changes entails, as a corollary, an exact arithmetic characterization of Putnam's n-trial predicates, which closes a gap of a factor of two in Putnam's original characterization .
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
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.
Citations of this work BETA
Kevin T. Kelly & Oliver Schulte (1995). The Computable Testability of Theories Making Uncomputable Predictions. Erkenntnis 43 (1):29 - 66.
Similar books and articles
Richard Pettigrew (2009). On Interpretations of Bounded Arithmetic and Bounded Set Theory. Notre Dame Journal of Formal Logic 50 (2):141-152.
Sean Fulop & Nick Chater (2013). Editors' Introduction: Why Formal Learning Theory Matters for Cognitive Science. Topics in Cognitive Science 5 (1):3-12.
Sanjay Jain & Arun Sharma (1997). The Structure of Intrinsic Complexity of Learning. Journal of Symbolic Logic 62 (4):1187-1201.
Benjamin D. Miller (2012). The Graph-Theoretic Approach to Descriptive Set Theory. Bulletin of Symbolic Logic 18 (4):554-575.
Joerg Flum (2003). Descriptive Complexity Theories. Theoria 18 (1):47-58.
Kevin T. Kelly (1988). Formal Learning Theory and the Philosophy of Science. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:413 - 423.
Nina Gierasimczuk (2009). Bridging Learning Theory and Dynamic Epistemic Logic. Synthese 169 (2):371-384.
Alexander Rueger (1998). Local Theories of Causation and the a Posteriori Identification of the Causal Relation. Erkenntnis 48 (1):27-40.
Oliver Schulte, Formal Learning Theory. Stanford Encyclopedia of Philosophy.
Bernhard Lauth (1993). Inductive Inference in the Limit for First-Order Sentences. Studia Logica 52 (4):491 - 517.
Dominique Lecomte (2005). Ω-Powers and Descriptive Set Theory. Journal of Symbolic Logic 70 (4):1210-1232.
Richard Pettigrew (2010). The Foundations of Arithmetic in Finite Bounded Zermelo Set Theory. Cahiers du Centre de Logique 17:99-118.
Daniel Lassiter (2008). Semantic Externalism, Language Variation, and Sociolinguistic Accommodation. Mind and Language 23 (5):607-633.
Duane M. Rumbaugh (1997). The Psychology of Harry F. Harlow: A Bridge From Radical to Rational Behaviorism. Philosophical Psychology 10 (2):197 – 210.
Added to index2010-12-22
Total downloads19 ( #147,771 of 1,726,995 )
Recent downloads (6 months)6 ( #118,705 of 1,726,995 )
How can I increase my downloads?