Learning-theoretic perspectives of acceptable numberings

DOI10.1007/BF02127967zbMath0891.68087MaRDI QIDQ1380421

Ganesh R. Baliga, Anil M. Shende

Publication date: 4 March 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

effective programming systemslimiting standardizable

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Control structures in hypothesis spaces: The influence on learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• Comparison of identification criteria for machine inductive inference
• An easy priority-free proof of a theorem of Friedberg
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• Periodicity in generations of automata
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Godel Numberings Versus Friedberg Numberings
• Language identification in the limit

This page was built for publication: Learning-theoretic perspectives of acceptable numberings