Research in the theory of inductive inference by GDR mathematicians - A survey
From MaRDI portal
additional informationfunctionalsindex setslanguage identificationprediction of functionstree acceptors
Bibliographies for mathematics in general (00A15) 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) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)
Cites work
- A formal theory of inductive inference. Part II
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Classes of Recursive Functions and Their Index Sets
- Der Iterierte Limes Rekursiver Funktionen und Die Arithmetische Hierarchie
- Erkennungs‐, Masz‐ Und Informationstheoretische Eigenschaften Regulärer Folgenmengen
- General random sequences and learnable sequences
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 3426901 (Why is no real title available?)
- scientific article; zbMATH DE number 3657797 (Why is no real title available?)
- scientific article; zbMATH DE number 3664425 (Why is no real title available?)
- scientific article; zbMATH DE number 3681142 (Why is no real title available?)
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 3681745 (Why is no real title available?)
- scientific article; zbMATH DE number 3702094 (Why is no real title available?)
- scientific article; zbMATH DE number 3703975 (Why is no real title available?)
- scientific article; zbMATH DE number 3487383 (Why is no real title available?)
- scientific article; zbMATH DE number 3508474 (Why is no real title available?)
- scientific article; zbMATH DE number 3515458 (Why is no real title available?)
- scientific article; zbMATH DE number 3515459 (Why is no real title available?)
- scientific article; zbMATH DE number 3517125 (Why is no real title available?)
- scientific article; zbMATH DE number 3520307 (Why is no real title available?)
- scientific article; zbMATH DE number 3520397 (Why is no real title available?)
- scientific article; zbMATH DE number 3523534 (Why is no real title available?)
- scientific article; zbMATH DE number 3526588 (Why is no real title available?)
- scientific article; zbMATH DE number 3536063 (Why is no real title available?)
- scientific article; zbMATH DE number 3539162 (Why is no real title available?)
- scientific article; zbMATH DE number 3539201 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 3541935 (Why is no real title available?)
- scientific article; zbMATH DE number 3543955 (Why is no real title available?)
- scientific article; zbMATH DE number 3566723 (Why is no real title available?)
- scientific article; zbMATH DE number 3566828 (Why is no real title available?)
- scientific article; zbMATH DE number 3584924 (Why is no real title available?)
- scientific article; zbMATH DE number 3583792 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- scientific article; zbMATH DE number 3625363 (Why is no real title available?)
- scientific article; zbMATH DE number 3269042 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3407175 (Why is no real title available?)
- scientific article; zbMATH DE number 3421944 (Why is no real title available?)
- Index sets of finite classes of recursively enumerable sets
- Indexmengen und Erkennung Rekursiver Funktionen
- Language identification in the limit
- Limiting recursion
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Some natural properties of strong-identification in inductive inference
- The extent and density of sequences within the minimal-program complexity hierarchies
- Toward a mathematical theory of inductive inference
- Tree acceptors and some of their applications
- Über Diagnostische Strategien an Determinierten Automaten
- Über Experimente an Automaten
Cited in
(28)- On the power of recursive optimizers
- Learning in the presence of partial explanations
- On the power of inductive inference from good examples
- Program size restrictions in computational learning
- Learning in the presence of inaccurate information
- On the intrinsic complexity of learning recursive functions
- Learning how to separate.
- Learning languages and functions by erasing
- Learning classes of approximations to non-recursive functions.
- Robust behaviorally correct learning.
- Learning by the process of elimination
- On learning of functions refutably.
- Robust learning -- rich and poor
- Absolutely no free lunches!
- Infinitary self-reference in learning theory
- Machine learning of higher-order programs
- Generalization versus classification
- Comparison of identification criteria for machine inductive inference
- Synthesizing learners tolerating computable noisy data
- Robust learning is rich
- Reflecting and self-confident inductive inference machines
- Case-based representation and learning of pattern languages
- Characterizing language identification in terms of computable numberings
- Polynomial-time inference of arbitrary pattern languages
- On the power of probabilistic strategies in inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- A non-learnable class of E-pattern languages
- Learning recursive functions: A survey
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)
