Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ic.2008.03.001
Title: Learning in Friedberg numberings
Authors: Jain, S. 
Stephan, F. 
Issue Date: 2008
Source: Jain, S., Stephan, F. (2008). Learning in Friedberg numberings. Information and Computation 206 (6) : 776-790. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ic.2008.03.001
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. © 2008 Elsevier Inc. All rights reserved.
Source Title: Information and Computation
URI: http://scholarbank.nus.edu.sg/handle/10635/43103
ISSN: 08905401
DOI: 10.1016/j.ic.2008.03.001
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

7
checked on Dec 11, 2017

Page view(s)

48
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.