Kolmogorov numberings and minimal identification
From MaRDI portal
Publication:1389656
DOI10.1016/S0304-3975(96)00295-2zbMATH Open0893.68082MaRDI QIDQ1389656FDOQ1389656
Authors: Sanjay Jain, Rūsiņš Freivalds 
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
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
- 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 Machine-Independent Theory of the Complexity of Recursive Functions
- Periodicity in generations of automata
- Comparison of identification criteria for machine inductive inference
- Title not available (Why is that?)
- Tradeoffs in the inductive inference of nearly minimal size programs
- Inductive inference of recursive functions: Qualitative theory
Cited In (6)
- On learning and co-learning of minimal programs
- Title not available (Why is that?)
- AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
- Title not available (Why is that?)
- 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)
