The Modern Theory of Induction

Kumaraswamy Velupillai

in Computable Economics

Published in print January 2000 | ISBN: 9780198295273
Published online November 2003 | e-ISBN: 9780191596988 | DOI:
 The Modern Theory of Induction

Show Summary Details


A theory of induction, based on the formalism of algorithmic complexity theory, is introduced in this chapter. This is then used to underpin a theory of learning and a computable basis for inductive inference. The historical and philosophical backdrops against which these theories developed are also given, albeit concisely.

Keywords: Church‐Turing thesis; complexity theory; Gold, E.M; induction; inductive inference; Kolmogorov‐Chaitin‐Martin Löf thesis; learning; Ray J. Solomonoff

Chapter.  8917 words. 

Subjects: Macroeconomics and Monetary Economics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.