Special Issue on
Algorithmic Learning Theoryfor ALT '93 in Theoretical Computer Science Vol. 137, No. 1, January 9, 1995. 
The Special Issue on Algorithmic Learning Theory for ALT'93 in Theoretical Computer Science has been edited by S. Arikawa, S. Miyano, and T. Yokomori.
S. Arikawa, S. Miyano, and T. Yokomori.
Preface,  pp. 1 


Masami Hagiya.
A typed λcalculus for provingbyexample and bottomup generalization procedure,  pp. 323 


Klaus P. Jantke and Steffen Lange.
Casebased representation and learning of pattern languages,  pp. 2551 


Yasuhito Mukouchi and Setsuo Arikawa.
Towards a mathematical theory of machine discovery from facts,  pp. 5384 


Sanjay Jain and Arun Sharma.
On aggregating teams of learning machines,  pp. 85108 


Akito Sakurai.
On the VCdimension of depth four threshold circuits and the complexity of Booleanvalued functions,  pp. 109127 


Ayumi Shinohara.
Complexity of computing VapnikChervonenkis dimension and some generalized dimensions,  pp. 129144 


Susumu Hasegawa, Hiroshi Imai, and Masaki Ishiguro.
εapproximations of klabel spaces,  pp. 145157 


Atsuyoshi Nakamura and Naoki Abe.
Exact learning of linear combinations of monotone terms from function value queries,  pp. 159176 


back to the ALT
Archives page
back to the Conference page 