ML Anthology

Learning in Friedberg Numberings

Sanjay Jain, Frank Stephan
ALT 2007 pp. 79-93
doi:10.1007/978-3-540-75225-7_10 /alt/2007/jain2007alt-learning/

Abstract

In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar equivalence problem compared to acceptable numberings. We show that every explanatorily learnable class can be learnt in some Friedberg numbering. However, such a result does not hold for behaviourally correct learning or finite learning. One can also show that some Friedberg numberings are so restrictive that all classes which can be explanatorily learnt in such Friedberg numberings have only finitely many infinite languages. We also study similar questions for several properties of learners such as consistency, conservativeness, prudence, iterativeness and non U-shaped learning. Besides Friedberg numberings, we also consider the above problems for programming systems with K -recursive grammar equivalence problem.

PDF ALT Semantic Scholar

Cite

Text

Jain and Stephan. "Learning in Friedberg Numberings." International Conference on Algorithmic Learning Theory, 2007. doi:10.1007/978-3-540-75225-7_10

Markdown

[Jain and Stephan. "Learning in Friedberg Numberings." International Conference on Algorithmic Learning Theory, 2007.](https://mlanthology.org/alt/2007/jain2007alt-learning/) doi:10.1007/978-3-540-75225-7_10

BibTeX

@inproceedings{jain2007alt-learning,
  title     = {{Learning in Friedberg Numberings}},
  author    = {Jain, Sanjay and Stephan, Frank},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2007},
  pages     = {79-93},
  doi       = {10.1007/978-3-540-75225-7_10},
  url       = {https://mlanthology.org/alt/2007/jain2007alt-learning/}
}