Kolmogorov numberings and minimal identification
From MaRDI portal
(Redirected from Publication:1389656)
Recommendations
- AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
- scientific article; zbMATH DE number 2077151
- Identifying nearly minimal Gödel numbers from additional information
- On a question about learning nearly minimal programs
- Inductive inference of recursive functions: qualitative theory
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3515457 (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
- Comparison of identification criteria for machine inductive inference
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- Tradeoffs in the inductive inference of nearly minimal size programs
Cited in
(6)- On learning and co-learning of minimal programs
- scientific article; zbMATH DE number 2077151 (Why is no real title available?)
- AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
- scientific article; zbMATH DE number 3900734 (Why is no real title available?)
- On the Buck-Stopping Identification of Numbers†
- Learning languages and functions by erasing
This page was built for publication: Kolmogorov numberings and minimal identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389656)
