On the learnability of recursively enumerable languages from good examples

On the learnability of recursively enumerable languages from good examples

10.1016/S0304-3975(00)00131-6

Saved in:
Bibliographic Details
Main Authors: Jain, S., Lange, S., Nessel, J.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
Computational learning theory
Good examples
Inductive inference
Online Access:http://scholarbank.nus.edu.sg/handle/10635/41043
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/41043

Similar Items