One-sided error probabilistic inductive inference and reliable frequency identification

DOI10.1016/0890-5401(91)90011-PzbMath0727.03028MaRDI QIDQ803119

Thomas Zeugmann, E. B. Kinber

Publication date: 1991

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

zbMATH Keywords

probabilistic inferenceinductive inferencemachine learninginference machineautomatic program synthesisabstract theory of program synthesishierarchies of inferable functionsinductive synthesis of programs for recursive functionsreliable identification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)

Related Items

On learning of functions refutably. ⋮ Probabilistic language learning under monotonicity constraints ⋮ Learning recursive functions: A survey ⋮ Reflective inductive inference of recursive functions ⋮ Robust learning with infinite additional information ⋮ Predictive learning models for concept drift ⋮ Learning classes of approximations to non-recursive functions. ⋮ The synthesis of language learners. ⋮ Inductive inference of approximations for recursive concepts ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings

Cites Work

• Comparison of identification criteria for machine inductive inference
• On the error correcting power of pluralism in BC-type inductive inference
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Some natural properties of strong-identification in inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Limiting recursion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item