Saving the phenomena: Requirements that inductive inference machines not contradict known data

DOI10.1016/0890-5401(88)90019-3zbMath0664.68086OpenAlexW2052801518MaRDI QIDQ1115637

Mark A. Fulk

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90019-3

zbMATH Keywords

partial recursive functionsinductive inference machinestriangular hierarchies

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (14)

Characterizing language identification by standardizing operations ⋮ Robust learning -- rich and poor ⋮ Ignoring data may be the only way to learn efficiently ⋮ Learning via queries in [+, <] ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Separation of uniform learning classes. ⋮ Learning recursive functions: A survey ⋮ Robust separations in inductive inference ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ Increasing the power of uniform inductive learners ⋮ Learning algebraic structures from text ⋮ Unnamed Item ⋮ Difficulties in Forcing Fairness of Polynomial Time Inductive Inference ⋮ Maximal machine learnable classes

Cites Work

• Comparison of identification criteria for machine inductive inference
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Saving the phenomena: Requirements that inductive inference machines not contradict known data