Control structures in hypothesis spaces: The influence on learning
From MaRDI portal
Publication:5958309
DOI10.1016/S0304-3975(00)00385-6zbMath0984.68211MaRDI QIDQ5958309
Mandayam Suraj, Sanjay Jain, John Case
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)
Related Items
Hypothesis spaces for learning, Index sets and universal numberings, Characterizing programming systems allowing program self-reference, Numberings optimal for learning, Effectivity questions for Kleene's recursion theorem, Effectivity Questions for Kleene’s Recursion Theorem, Index Sets and Universal Numberings, Hypothesis Spaces for Learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A connotational theory of program structure
- Prudence and other conditions on formal language learning
- Finding patterns common to a set of strings
- The independence of control structures in abstract programming systems
- Classical recursion theory. Vol. II
- Composition is almost (but not quite) as good as \(s-1-1\)
- Learning-theoretic perspectives of acceptable numberings
- The intrinsic complexity of language identification
- On the intrinsic complexity of learning
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Gödel numberings of partial recursive functions
- Inductive Inference and Computable One‐One Numberings
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- A note on direct sums of Friedbergnumberings
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
