Computational epistemology
Computational epistemology is a subdiscipline of formal epistemology that studies the intrinsic complexity of inductive problems for ideal and computationally bounded agents. In short, computational epistemology is to induction what recursion theory is to deduction. It has been applied to problems in philosophy of science.
Computational epistemology - Wikipedia Jump to content From Wikipedia, the free encyclopedia Subdiscipline of formal epistemology Computational epistemology is a subdiscipline of formal epistemology that studies the intrinsic complexity of inductive problems for ideal and computationally bounded agents. In short, computational epistemology is to induction what recursion theory is to deduction . It has been applied to problems in philosophy of science . Themes [ edit ] Some of the themes of computational epistemology include: the essential likeness of induction and deduction (as illustrated by
Explore this link on the map →related reading
- The Problem of Induction and Machine Learning | Vaden Masranivmasrani.github.io
- An Intuitive Explanation of Solomonoff Induction — LessWronglesswrong.com
- How To Think Real Good | Meta-rationalitymetarationality.com
- 'Empiricism!' as Anti-Epistemology — LessWronglesswrong.com
- Epistemology - Wikipediaen.wikipedia.org
- A Technical Introduction to Solomonoff Induction without K-Complexity — LessWronglesswrong.com
- Philosophy of Mathematics (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Solomonoff's theory of inductive inference - Wikipediaen.wikipedia.org
- Epistemology | Definition, History, Types, Examples, Philosophers, & Facts | Britannicabritannica.com
- Coherentism - Wikipediaen.wikipedia.org
- Epistemology (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- A Semitechnical Introductory Dialogue on Solomonoff Induction — AI Alignment Forumalignmentforum.org