Theoretical Computer Science, Volume 241

Volume 241, Numbers 1-2, 28 June 2000

• Paul M. B. Vitányi:
  A discipline of evolutionary programming. 3-23
  
• Philip M. Long:
  Improved bounds about on-line learning of smooth-functions of a single variable. 25-35
  
• Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
  The learnability of exclusive-or expansions based on monotone DNF formulas. 37-50
  
• Vikraman Arvind, N. V. Vinodchandran:
  Exact learning via teaching assistants. 51-81
  
• Atsuyoshi Nakamura:
  Query learning of bounded-width OBDDs. 83-114
  
• John Case, Sanjay Jain, Frank Stephan:
  Vacillatory and BC learning on noisy data. 115-141
  
• Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann:
  Learning languages and functions by erasing. 143-189
  
• Takeshi Shinohara, Hiroki Arimura:
  Inductive inference of unbounded unions of pattern languages from positive data. 191-209
  
• M. R. K. Krishna Rao:
  Some classes of prolog programs inferable from positive data. 211-234