Control structures in hypothesis spaces: The influence on learning

DOI10.1016/S0304-3975(00)00385-6zbMath0984.68211OpenAlexW2166329216MaRDI QIDQ5958309

Mandayam Suraj, Sanjay Jain, John Case

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00385-6

zbMATH Keywords

computational learning theoryinductive inferencelanguagescontrol structuresnumberings

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (8)

Effectivity Questions for Kleene’s Recursion Theorem ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Index Sets and Universal Numberings ⋮ Numberings optimal for learning ⋮ Hypothesis spaces for learning ⋮ Index sets and universal numberings ⋮ Characterizing programming systems allowing program self-reference ⋮ Hypothesis Spaces for Learning

Uses Software

• C4.5

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

This page was built for publication: Control structures in hypothesis spaces: The influence on learning