Prescribed learning of r.e. classes
type: Item
instance of: scholarly article
title: Prescribed learning of r.e. classes
zbMATH Open document ID: 1167.68026
author: Sanjay Jain
author: Frank Stephan
author: Nan Ye
published in: Theoretical Computer Science
publication date: 2009-05-12T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5552990
zbMATH Keywords: inductive inference
zbMATH Keywords: prescribed learning
zbMATH Keywords: formal languages
zbMATH Keywords: recursion theory
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.01.011
OpenAlex ID: W2105329810
cites work: Inductive inference of formal languages from positive data
cites work: When unlearning helps
cites work: Toward a mathematical theory of inductive inference
cites work: The Power of Vacillation in Language Learning
cites work: Q3704910
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: Prudence and other conditions on formal language learning
cites work: Language identification in the limit
cites work: Prudence in vacillatory language identification
cites work: Learning in Friedberg numberings
cites work: Q4281570
cites work: Monotonic and dual monotonic language learning
cites work: Q4023358
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Learning strategies
cites work: Recursively enumerable sets of positive integers and their decision problems
cites work: Q4040892
cites work: Q4282560
cites work: Characterizations of monotonic and dual monotonic language learning
cites work: Separation of uniform learning classes.
cites work: Increasing the power of uniform inductive learners
DOI: 10.1016/J.TCS.2009.01.011
description: scientific article; zbMATH DE number 5552990