Putnam's diagonal argument and the impossibility of a universal learning machine
From MaRDI portal
Publication:2051127
DOI10.1007/s10670-018-9975-xzbMath1474.03054OpenAlexW2396114581MaRDI QIDQ2051127
Publication date: 24 November 2021
Published in: Erkenntnis (Search for Journal in Brave)
Full work available at URL: http://philsci-archive.pitt.edu/15137/1/solput.pdf
Philosophical and critical aspects of logic and foundations (03A05) Algorithmic randomness and dimension (03D32)
Related Items (4)
ON THE TRUTH-CONVERGENCE OF OPEN-MINDED BAYESIANISM ⋮ The no-free-lunch theorems of supervised learning ⋮ On the computability of Solomonoff induction and AIXI ⋮ Absolutely no free lunches!
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A philosophical treatise of universal induction
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
- Calibration-based empirical probability
- On the consistency of Bayes estimates
- Hypotheses and inductive predictions
- On universal prediction and Bayesian confirmation
- On the Computability of Solomonoff Induction and Knowledge-Seeking
- Turing Computability
- Algorithmic Randomness and Complexity
- MERGING OF OPINIONS AND PROBABILITY KINEMATICS
- Convergence and loss bounds for bayesian sequence prediction
- Asymptotics of Discrete MDL for Online Prediction
- Self-Calibrating Priors Do Not Exist
- Merging of Opinions with Increasing Information
- Complexity-based induction systems: Comparisons and convergence theorems
- Kolmogorov Complexity and Algorithmic Randomness
- Computability and Randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A formal theory of inductive inference. Part II
- On Computable Numbers, with an Application to the Entscheidungsproblem
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Putnam's diagonal argument and the impossibility of a universal learning machine
