|
Computer Science
Students dive into engineering at Rowan University event | More Rowan professor helps computers keep pace with evolving challenges | More Cooper Medical School of Rowan University leaves compelling legacy for future students, faculty and staff | More Congratulations Graduates 2013! | More Regional high school students can RISE in Rowan Engineering | MoreTitle Authors John Case Sanjay Jain Abstract In the context of learning programs in the limit for functions, a
variety of enumeration techniques are important and ubiquitous. Here
is the archetypal case. Suppose one has an recursively enumerable set The present paper was inspired by the following amazingly negative
result due to Osherson, Stob and Weinstein. They show: there is no
algorithm for translating any pair of grammars (g,g') into a learning
procedure which, from positive data about any one of the languages
generated by g and g', finds in the limit, for this language, a
correct grammar! In this paper we seek to assuage this negative result
by loosening the requirements of successful learning. We consider the
limiting synthesis of learning machines for learnable recursively
enumerable classes of languages. One of the results in this paper is a |


Students dive into engineering at Rowan University event |