Learning-theoretic perspectives of acceptable numberings
type: Item
instance of: scholarly article
title: Learning-theoretic perspectives of acceptable numberings
zbMATH Open document ID: 0891.68087
DOI: 10.1007/BF02127967
author: Ganesh R. Baliga
author: Anil M. Shende
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1998-03-04T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1123693
zbMATH Keywords: limiting standardizable
zbMATH Keywords: effective programming systems
MaRDI profile type: Publication
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Periodicity in generations of automata
cites work: Comparison of identification criteria for machine inductive inference
cites work: CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: Language identification in the limit
cites work: Q4079595
cites work: An easy priority-free proof of a theorem of Friedberg
cites work: Q4153600
cites work: Godel Numberings Versus Friedberg Numberings
cites work: Q5522188
cites work: Q4903274
cites work: Gödel numberings of partial recursive functions
cites work: Q5573961
cites work: A connotational theory of program structure
cites work: Q3819052
description: scientific article; zbMATH DE number 1123693