Research in the theory of inductive inference by GDR mathematicians - A survey

DOI10.1016/S0020-0255(80)80006-5zbMath0459.03021WikidataQ60574926 ScholiaQ60574926MaRDI QIDQ1151889

Reinhard Klette, Rolf Wiehagen

Publication date: 1980

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

functionalsindex setsadditional informationlanguage identificationprediction of functionstree acceptors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computability and recursion theory (03D99) Bibliographies for mathematics in general (00A15)

Related Items

On learning of functions refutably., Robust learning -- rich and poor, Program size restrictions in computational learning, Learning in the presence of inaccurate information, Infinitary self-reference in learning theory, On the power of recursive optimizers, Generalization versus classification, Machine learning of higher-order programs, Reflecting and self-confident inductive inference machines, On the intrinsic complexity of learning recursive functions, Absolutely no free lunches!, Learning how to separate., Learning recursive functions: A survey, Learning in the presence of partial explanations, Case-based representation and learning of pattern languages, Characterizing language identification in terms of computable numberings, On the power of inductive inference from good examples, Synthesizing learners tolerating computable noisy data, Robust learning is rich, Comparison of identification criteria for machine inductive inference, Polynomial-time inference of arbitrary pattern languages, On the power of probabilistic strategies in inductive inference, Learning languages and functions by erasing, Learning classes of approximations to non-recursive functions., Robust behaviorally correct learning., Learning by the process of elimination, One-sided error probabilistic inductive inference and reliable frequency identification, A non-learnable class of E-pattern languages

Cites Work

• The extent and density of sequences within the minimal-program complexity hierarchies
• Some natural properties of strong-identification in inductive inference
• Tree acceptors and some of their applications
• Über Diagnostische Strategien an Determinierten Automaten
• Indexmengen und Erkennung Rekursiver Funktionen
• General random sequences and learnable sequences
• Toward a mathematical theory of inductive inference
• Der Iterierte Limes Rekursiver Funktionen und Die Arithmetische Hierarchie
• Erkennungs‐, Masz‐ Und Informationstheoretische Eigenschaften Regulärer Folgenmengen
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Über Experimente an Automaten
• Index sets of finite classes of recursively enumerable sets
• Limiting recursion
• Classes of Recursive Functions and Their Index Sets
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Language identification in the limit
• A formal theory of inductive inference. Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item