منابع مشابه
Team Learning of Formal Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined size, of the team learns the concept. Team learning of computer programs for computable functions from their graphs has been studied extensively. However, team learning of languages turns out to be a more suitable theor...
متن کاملOn the Classiication of Computable Languages
A one-sided classiier converges to 1 on every set inside a given class and outputs innnitely often a 0 on every set outside the class. A two-sided classiier converges in the rst case to 1 and in the second to 0. This paper considers one-sided and two-sided classiiers dealing with computable sets as input. It provides theorems from which the classiiability of natural examples can be assessed and...
متن کاملOn the Classification of Computable Languages
1 Computer and Information Sciences Department, 101A Smith Hall, University of Delaware, Newark, DE 19716-2586, U.S.A., case~cis .udel .edu. 2 Computer Science, Sacred Heart University, 5151 Park Avenue, Fairfield, CT 06432-1000, U.S.A., kinberCshu, sacredheart , edu. 3 School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, 2052, Australia, arun 9 unsw. edu....
متن کاملComputable Models of the Law, Languages, Dialogues, Games, Ontologies
Bring home now the book enPDFd computable models of the law languages dialogues games ontologies to be your sources when going to read. It can be your new collection to not only display in your racks but also be the one that can help you fining the best sources. As in common, book is the window to get in the world and you can open the world easily. These wise words are really familiar with you,...
متن کاملComputational Limits on Team Identification of Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully identify a concept just in case each member of some nonempty subset, of predetermined size, of the team identifies the concept. Team identification of programs for computable functions from their graphs has been investigated by Smith. Pitt showed that this notion is essentially equivalent to function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2000
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s002249910003