Induction, algorithmic learning theory, and philosophy

The idea of the present volume emerged in 2002 from a series of talks by frank stephan in 2002, and john case in 2003, on developments of algorithmic learning theory. these talks took place in the mathematics department at the george washington university. following the talks, valentinaharizanovandmichèlefriendraised thepossibility ofanexchange of ideas concerning algorithmic learning theory. in particular, this was to be a mutually bene?cial exchange between philosophers, mathematicians and computer scientists. harizanov and friend sent out invitations for contributions and invited norma goethe to join the editing team. the dilthey fellowship of the george washington university provided resources over the summer of 2003 to enable the editors and some of the contributors to meet in oviedo (spain) at the 12th international congress of logic, methodology and philosophy of science. the editing work proceeded from there. the idea behind the volume is to rekindle interdisciplinary discussion. algorithmic learning theory has been around for nearly half a century. the immediate beginnings can be traced back to e.m. gold’s papers: “limiting recursion” (1965) and “language identi?cation in the limit” (1967). however, from a logical point of view, the deeper roots of the learni- theoretic analysis go back to carnap’s work on inductive logic (1950, 1952).