Uncomputability: The problem of induction internalized
From MaRDI portal
Recommendations
Cites work
- 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?)
- Descriptive set theory
- 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
(6)- The undecidability of the definability of principal subcongruences
- Ockham's razor, empirical complexity, and truth-finding efficiency
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Logical dialogues with explicit preference profiles and strategy selection
- The case for hypercomputation
- The interrogative model of inquiry and inquiry learning
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)