Can Learning in the Limit Be Done Efficiently?

Thomas Zeugmann. Can Learning in the Limit Be Done Efficiently?. In Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto, editors, Algorithmic Learning Theory, 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings. Volume 2842 of Lecture Notes in Computer Science, pages 17-38, Springer, 2003. [doi]

@inproceedings{Zeugmann03,
  title = {Can Learning in the Limit Be Done Efficiently?},
  author = {Thomas Zeugmann},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2842&spage=17},
  researchr = {https://researchr.org/publication/Zeugmann03},
  cites = {0},
  citedby = {0},
  pages = {17-38},
  booktitle = {Algorithmic Learning Theory, 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings},
  editor = {Ricard Gavaldà and Klaus P. Jantke and Eiji Takimoto},
  volume = {2842},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20291-9},
}