Special Issue on

Algorithmic Learning Theory

for ALT '97 in

ALT 97 Logo

Theoretical Computer Science Volume 261, Issue 1, 17 June 2001.

The Special Issue on Algorithmic Learning Theory for ALT '97 has been edited by Ming Li.

Table of Contents

Ming Li.

pp. 1

Sanjay Jain, Steffen Lange and Jochen Nessel.
On the learnability of recursively enumerable languages from good examples,

pp. 3 - 29

John Case, Sanjay Jain and Arun Sharma.
Synthesizing noise-tolerant language learners,

pp. 31 - 56

V. Vovk.
Probability theory for the Brier game,

pp. 57 - 79

Leonid Gurvits
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces,

pp. 81 - 90

Andris Ambainis, Kalvis Apsitis, Rusins Freivalds and Carl H. Smith.
Hierarchies of probabilistic and team FIN-learning,

pp. 91 - 117

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger and Thomas Zeugmann.
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries,

pp. 119 - 156

Wolfgang Maass.
On the relevance of time in neural computation and learning,

pp. 157 - 178

Eiji Takimoto, Akira Maruoka and Volodya Vovk.
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme,
pp. 179 - 209

uparrowback to the ALT Archives page

uparrow uparrowback to the Conference page

Valid HTML 4.1!