Machine induction without revolutionary paradigm shifts
From MaRDI portal
Recommendations
- Machine induction without revolutionary changes in hypothesis size
- Parsimony hierarchies for inductive inference
- INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- scientific article; zbMATH DE number 1351089
Cites work
- A connotational theory of program structure
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Approximate inference and scientific method
- Comparison of identification criteria for machine inductive inference
- Gödel numberings of partial recursive functions
- scientific article; zbMATH DE number 3485695 (Why is no real title available?)
- scientific article; zbMATH DE number 3515457 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (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?)
- Language identification in the limit
- Machine learning of higher-order programs
- On a question about learning nearly minimal programs
- ON LEARNING LIMITING PROGRAMS
- Prudence in vacillatory language identification
- The independence of control structures in abstract programming systems
- The Power of Vacillation in Language Learning
- Toward a mathematical theory of inductive inference
- Tradeoffs in the inductive inference of nearly minimal size programs
- Training sequences
This page was built for publication: Machine induction without revolutionary paradigm shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083908)
