On learning of functions refutably.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3861134 (Why is no real title available?)
- scientific article; zbMATH DE number 3952736 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- scientific article; zbMATH DE number 1351096 (Why is no real title available?)
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- scientific article; zbMATH DE number 2077177 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Classifying Predicates and Languages
- Comparison of identification criteria for machine inductive inference
- Generalization versus classification
- Inductive inference of recursive functions: complexity bounds
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- Learning with refutation
- Limiting recursion
- On completely recursively enumerable classes and their key arrays
- On one-sided versus two-sided classification
- On the classification of computable languages
- On the intrinsic complexity of learning
- One-sided error probabilistic inductive inference and reliable frequency identification
- Periodicity in generations of automata
- Reflecting inductive inference machines and its improvement by therapy
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Some natural properties of strong-identification in inductive inference
- Toward a mathematical theory of inductive inference
- Towards a mathematical theory of machine discovery from facts
Cited in
(13)- scientific article; zbMATH DE number 1149407 (Why is no real title available?)
- scientific article; zbMATH DE number 2080665 (Why is no real title available?)
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Costs of general purpose learning
- On some open problems in reflective inductive inference
- Trees and learning
- Anomalous vacillatory learning
- Improper learning by refuting
- Refuting learning revisited.
- Reflective inductive inference of recursive functions
- scientific article; zbMATH DE number 2077179 (Why is no real title available?)
- scientific article; zbMATH DE number 2080443 (Why is no real title available?)
- scientific article; zbMATH DE number 2080664 (Why is no real title available?)
This page was built for publication: On learning of functions refutably.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874231)
