Themes
Some of the themes of computational epistemology include:
- the essential likeness of induction and deduction (as illustrated by systematic analogies between their respective complexity classes)
- the treatment of discovery, prediction and assessment methods as effective procedures (algorithms) as originates in algorithmic learning theory.
- the characterization of inductive inference problems as consisting of:
- a set of relevant possibilities (possible worlds), each of which specifies some potentially infinite sequence of inputs to the scientist’s method,
- a question whose potential answers partition the relevant possibilities (in the set theoretic sense),
- a convergent success criterion and
- a set of admissible methods
- the notion of logical reliability for inductive problems
Read more about this topic: Computational Epistemology
Famous quotes containing the word themes:
“I suppose you think that persons who are as old as your father and myself are always thinking about very grave things, but I know that we are meditating the same old themes that we did when we were ten years old, only we go more gravely about it.”
—Henry David Thoreau (1817–1862)
“In economics, we borrowed from the Bourbons; in foreign policy, we drew on themes fashioned by the nomad warriors of the Eurasian steppes. In spiritual matters, we emulated the braying intolerance of our archenemies, the Shi’ite fundamentalists.”
—Barbara Ehrenreich (b. 1941)