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. Themes. Some of the themes of computational epistemology include: Quotations. Computational epistemology definition: On making inductive problems easier to solve: On the divergence of computational epistemology from Bayesian confirmation theory and the like: Computational epistemology in a nutshell: On the proper role of methodology: