Uncomputability: The problem of induction internalized

DOI10.1016/J.TCS.2003.12.013zbMath1050.03029OpenAlexW2089855016MaRDI QIDQ1434378

Kevin T. Kelly

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.013

zbMATH Keywords

learning in the limitinductive reasoningcomputing in the limithyper-computation

Mathematics Subject Classification ID

Computational learning theory (68Q32) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Related Items (4)

Ockham's razor, empirical complexity, and truth-finding efficiency ⋮ Logical dialogues with explicit preference profiles and strategy selection ⋮ The Interrogative Model of Inquiry and Inquiry Learning ⋮ The case for hypercomputation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Descriptive set theory
• On the role of procrastination in machine learning
• The logic of success
• Means-Ends Epistemology
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion

This page was built for publication: Uncomputability: The problem of induction internalized