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
related reading
- Solomonoff's theory of inductive inference - Wikipediaen.wikipedia.org
- Towards a Formal Scientific Epistemologymindthefuture.info
- 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
- Naturalized epistemology - Wikipediaen.wikipedia.org
- Why I'm not a Bayesianmindthefuture.info
- Epistemology - Wikipediaen.wikipedia.org
- A Technical Introduction to Solomonoff Induction without K-Complexity — LessWronglesswrong.com
- New riddle of induction - Wikipediaen.wikipedia.org
- Strong Inference: Certain systematic methods of scientific thinking may produce much more rapid progress than othersgwern.net