Parsimony hierarchies for inductive inference (Q5311725): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning elementary formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalized notion of mistake bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal mind change complexity of language identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary formal systems, intrinsic complexity, and procrastination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5340125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theoretic models of learning: Some results and intuitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2720321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of procrastination in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connotational theory of program structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in the inductive inference of nearly minimal size programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine induction without revolutionary changes in hypothesis size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental concept learning for bounded data mining. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive learning models for concept drift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary self-reference in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity in generations of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) / rank
 
Normal rank

Latest revision as of 15:45, 10 June 2024

scientific article; zbMATH DE number 2199931
Language Label Description Also known as
English
Parsimony hierarchies for inductive inference
scientific article; zbMATH DE number 2199931

    Statements

    Parsimony hierarchies for inductive inference (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 August 2005
    0 references
    0 references
    computational learning theory
    0 references
    minimal size program
    0 references
    constructive ordinal notations
    0 references
    limiting computable functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references