Aggregating inductive expertise on partial recursive functions

DOI10.1016/0890-5401(92)90045-HzbMath0754.03033MaRDI QIDQ1187022

Britta Schinzel, Anna-Maria Emde

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

inductive inferencepartial recursive functionsinference machines

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Probability and plurality for aggregations of learning machines
• Some natural properties of strong-identification in inductive inference
• Aggregating inductive expertise
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Anomaly hierarchies of mechanized inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Classes of Recursively Enumerable Sets and Their Decision Problems

This page was built for publication: Aggregating inductive expertise on partial recursive functions