Costs of general purpose learning
From MaRDI portal
Recommendations
Cites work
- A connotational theory of program structure
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Comparison of identification criteria for machine inductive inference
- Gödel numberings of partial recursive functions
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 3518782 (Why is no real title available?)
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Identifying nearly minimal Gödel numbers from additional information
- Language identification in the limit
- Periodicity in generations of automata
- Some natural properties of strong-identification in inductive inference
- The independence of control structures in abstract programming systems
- Toward a mathematical theory of inductive inference
Cited in
(3)
This page was built for publication: Costs of general purpose learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941288)