Uncomputability: The problem of induction internalized

DOI10.1016/J.TCS.2003.12.013MaRDI QIDQ1434378zbMATH OpenOpenAlexFDO

Authors 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

computing in the limithyper-computationinductive reasoninglearning in the limit

Mathematics Subject Classification ID

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

Review text

A comparison of inductive reasoning with drawing conclusions from a Turing-machine computation that might not halt. This comes as no surprise to computability theorists. Indeed, the author admits, ``The basic idea is not new. It was pioneered by Putnam and Gold and has since then served as a fertile source of ideas within computational learning theory. The author could have presented the material more concisely by using standard computability-theory concepts and terminology such as c.e., co-c.e., computation relative to \(\mathbf {0}'\), etc.

Recommendations

• scientific article; zbMATH DE number 1163989
• The hypercomputation thesis: stakes and philosophical problems
• Hypercomputation: Philosophical issues
• Induction: a logical analysis
• On the computability of Solomonoff induction and knowledge-seeking

Cites work

• Descriptive set theory
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 1163989 (Why is no real title available?)
• scientific article; zbMATH DE number 1846036 (Why is no real title available?)
• Limiting recursion
• Means-Ends Epistemology
• On the role of procrastination in machine learning
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The logic of success
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(7)

• Logical dialogues with explicit preference profiles and strategy selection
• Ockham's razor, empirical complexity, and truth-finding efficiency
• The case for hypercomputation
• The interrogative model of inquiry and inquiry learning
• scientific article; zbMATH DE number 1163989 (Why is no real title available?)
• The undecidability of the definability of principal subcongruences
• From undecidability of non-triviality and finiteness to undecidability of learnability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434378)