Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction

DOI10.1007/S10992-009-9111-0zbMath1181.03024OpenAlexW1987328002MaRDI QIDQ1037380

Daniel Steel

Publication date: 16 November 2009

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-009-9111-0

zbMATH Keywords

testabilityinductive inferencestatistical learning theorysimplicityOckham's razorformal learning theoryGoodmannew riddle of induction

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logic in the philosophy of science (03A10)

Related Items (1)

What If the Principle of Induction Is Normative? Formal Learning Theory and Hume’s Problem

Cites Work

• Unnamed Item
• Unnamed Item
• The logic of reliable and efficient inquiry
• Ockham's razor, empirical complexity, and truth-finding efficiency
• Means-Ends Epistemology

This page was built for publication: Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction