PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
From MaRDI portal
Publication:3495668
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3485695 (Why is no real title available?)
- scientific article; zbMATH DE number 3445215 (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
- A formal theory of inductive inference. Part I
- Formal Reductions of the General Combinatorial Decision Problem
- Induction, pure and simple
- Language identification in the limit
- On the size of machines
- Provability, truth, and modal logic
- Toward a mathematical theory of inductive inference
Cited in
(4)
This page was built for publication: PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495668)