A learning-theoretic characterization of classes of recursive functions
type: Item
instance of: scholarly article
title: A learning-theoretic characterization of classes of recursive functions
zbMATH Open document ID: 0875.68271
DOI: 10.1016/0020-0190(95)00036-C
author: Juan-Miguel Gracia
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 985696
zbMATH Keywords: Inductive inference
zbMATH Keywords: Programming systems
zbMATH Keywords: Theory of computation
zbMATH Keywords: Theory of numberings
MaRDI profile type: Publication
cites work: Computable enumerations of families of general recursive functions
cites work: On computable enumerations. I
cites work: Theorie der Numerierungen I
cites work: Q3863873
cites work: Q4470539
cites work: Language identification in the limit
cites work: Autostability of models and Abelian groups
cites work: Q4501145
cites work: Discrete families of recursive functions and index sets
cites work: An enumeration of the primitive recursive functions without repetition
cites work: The computable enumerations of families of general recursive functions
cites work: A connotational theory of program structure
cites work: Q4310702
cites work: Enumerations of families of general recursive functions
cites work: Q4040892
cites work: Q3751553
cites work: Q4282560
description: scientific article; zbMATH DE number 985696