Control structures in hypothesis spaces: The influence on learning

DOI10.1016/S0304-3975(00)00385-6MaRDI QIDQ5958309zbMATH OpenOpenAlexFDO

Authors John Case, Sanjay Jain, Mandayam Suraj

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 theorycontrol structuresinductive inferencelanguagesnumberings

Mathematics Subject Classification ID

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

Recommendations

• Hypothesis spaces for learning
• Hypothesis Spaces for Learning
• Changing the inference type -- keeping the hypothesis space
• Learnability and the Vapnik-Chervonenkis dimension
• On learnability, complexity and stability

Cites work

• A connotational theory of program structure
• A Machine-Independent Theory of the Complexity of Recursive Functions
• A note on direct sums of Friedbergnumberings
• Classical recursion theory. Vol. II
• Composition is almost (but not quite) as good as \(s-1-1\)
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• Finding patterns common to a set of strings
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 3660776 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3604877 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning-theoretic perspectives of acceptable numberings
• On the intrinsic complexity of learning
• Prudence and other conditions on formal language learning
• The independence of control structures in abstract programming systems
• The intrinsic complexity of language identification
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Toward a mathematical theory of inductive inference

Cited in

(8)

• Effectivity questions for Kleene's recursion theorem
• Effectivity questions for Kleene's recursion theorem
• Index sets and universal numberings
• Hypothesis Spaces for Learning
• Hypothesis spaces for learning
• Index sets and universal numberings
• Characterizing programming systems allowing program self-reference
• Numberings optimal for learning

Describes a project that uses

Uses Software

• C4.5

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958309)