The paper under review is set in the context of algorithmic learning theory and "analyzes the problem of algorithmically learning a description for a formal language (a computably enumerable subset of the set of natural numbers) when presented successively all and only the elements of that language''. e of the relationships among the classes of languages that can be learned under the various restrictions and learning criteria, thus providing a valuable compendium of language learning in the limit.

Review of Kötzing, Timo; Palenta, Raphaela A map of update constraints in inductive inference. Theoret. Comput. Sci. 650 (2016), 4-24

Fabrizio Riguzzi
2017

Abstract

The paper under review is set in the context of algorithmic learning theory and "analyzes the problem of algorithmically learning a description for a formal language (a computably enumerable subset of the set of natural numbers) when presented successively all and only the elements of that language''. e of the relationships among the classes of languages that can be learned under the various restrictions and learning criteria, thus providing a valuable compendium of language learning in the limit.
2017
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11392/2381633
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact