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

DOI10.1016/S0020-0255(80)80006-5zbMATH Open0459.03021WikidataQ60574926 ScholiaQ60574926MaRDI QIDQ1151889FDOQ1151889

Authors: Reinhard Klette, Rolf Wiehagen 

Publication date: 1980

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

zbMATH Keywords

additional informationindex setsfunctionalslanguage identificationprediction of functionstree acceptors

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) 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) Computability and recursion theory (03D99) Bibliographies for mathematics in general (00A15)

Cites Work

• Some natural properties of strong-identification in inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• A formal theory of inductive inference. Part II
• 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
• Limiting recursion
• Tree acceptors and some of their applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General random sequences and learnable sequences
• Title not available (Why is that?)
• The extent and density of sequences within the minimal-program complexity hierarchies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Über Diagnostische Strategien an Determinierten Automaten
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Indexmengen und Erkennung Rekursiver Funktionen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Der Iterierte Limes Rekursiver Funktionen und Die Arithmetische Hierarchie
• Erkennungs‐, Masz‐ Und Informationstheoretische Eigenschaften Regulärer Folgenmengen
• Title not available (Why is that?)
• Über Experimente an Automaten
• Index sets of finite classes of recursively enumerable sets
• Classes of Recursive Functions and Their Index Sets

Cited In (28)

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

This page was built for publication: Research in the theory of inductive inference by GDR mathematicians - A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151889)