Theoretical Computer Science Volume 397, Issue 1-3, May 20, 2008.. The Special Issue Forty Years of Inductive Inference: Dedicated to the 60th Birthday of Rolf Wiehagen has been edited by John Case, Takeshi Shinohara, Thomas Zeugmann, and Sandra Zilles

Table of Contents

John Case, Takeshi Shinohara, Thomas Zeugmann, and Sandra Zilles. Foreword,	pp. 1-3
Thomas Zeugmann and Sandra Zilles. Learning recursive functions: A survey, Abstract.	pp. 4-56
Gunter Grieser. Reflective inductive inference of recursive functions, Abstract.	pp. 57-69
R. Freivalds and R.F. Bonner. Quantum inductive inference by finite automata, Abstract.	pp. 70-76
Jan Poland. Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments, Abstract.	pp. 77-93
Frank J. Balbach. Measuring teachability using variants of the teaching dimension, Abstract.	pp. 94-113
Sanjay Jain, Eric Martin, and Frank Stephan. Absolute versus probabilistic classification in a logical setting, Abstract.	pp. 114-128
M.R.K. Krishna Rao. Some classes of term rewriting systems inferable from positive data, Abstract.	pp. 129-149
Yen Kaow Ng and Takeshi Shinohara. Developments from enquiries into the learnability of the pattern languages from positive data, Abstract.	pp. 150-165
Daniel Reidenbach. Discontinuities in pattern inference, Abstract.	pp. 166-193
Steffen Lange, Thomas Zeugmann and Sandra Zilles. Learning indexed families of recursive languages from positive data: A survey, Abstract.	pp. 194-232
Sanjay Jain, and Efim Kinber. Learning and extending sublanguages, Abstract.	pp. 233-246
back to Editorial Work