Some natural properties of strong-identification in inductive inference
From MaRDI portal
Publication:1244823
DOI10.1016/0304-3975(76)90087-6zbMath0373.68051OpenAlexW1999116843WikidataQ127088244 ScholiaQ127088244MaRDI QIDQ1244823
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90087-6
Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory and constructive mathematics (03F99)
Related Items (41)
On learning of functions refutably. ⋮ Refuting learning revisited. ⋮ Semantic analysis of inductive reasoning ⋮ Trees and learning ⋮ Robust learning -- rich and poor ⋮ Learning Families of Closed Sets in Matroids ⋮ On the classification of computable languages ⋮ Enlarging learnable classes ⋮ Saving the phenomena: Requirements that inductive inference machines not contradict known data ⋮ Classes with easily learnable subclasses ⋮ On the classification of recursive languages ⋮ Generalization versus classification ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Reflecting and self-confident inductive inference machines ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Dynamic Modeling in Inductive Inference ⋮ Learning how to separate. ⋮ Learning recursive functions: A survey ⋮ Reflective inductive inference of recursive functions ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Towards a mathematical theory of machine discovery from facts ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ On some open problems in reflective inductive inference ⋮ Robust learning with infinite additional information ⋮ Costs of general purpose learning ⋮ Probabilistic inductive inference: A survey ⋮ Unnamed Item ⋮ Comparison of identification criteria for machine inductive inference ⋮ Partial learning of recursively enumerable languages ⋮ Unnamed Item ⋮ Learning with refutation ⋮ MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY ⋮ Maximal machine learnable classes ⋮ Learning classes of approximations to non-recursive functions. ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings ⋮ Avoiding coding tricks by hyperrobust learning ⋮ Training sequences ⋮ On the role of update constraints and text-types in iterative learning
Cites Work
This page was built for publication: Some natural properties of strong-identification in inductive inference
