Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Consistent and coherent learning with \(\delta \)-delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimony hierarchies for inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Structures and Ershov's Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: When unlearning helps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Learning of Simple External Contextual Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
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: Results on memory-limited U-shaped learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-U-shaped vacillatory and team learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Vacillation in Language Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically Delayed Postdictive Completeness and Consistency in Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: U-shaped, iterative, and iterative-with-counter learning / 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: Q4300060 / 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: Generality's price: Inescapable deficiencies in machine-learned programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible Iteration of Feasible Learning Functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / 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: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3231529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizations of the basic feasible functionals, Part I / 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: A new Characterization of Type-2 Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language learning from texts: Mindchanges, limited memory and monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and abstract subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An average-case optimal one-variable pattern language learner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Efficiency of Very Simple Grammars from Positive Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: From learning in the limit to stochastic finite learning / rank
 
Normal rank

Revision as of 01:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Resource restricted computability theoretic learning: Illustrative topics and problems
scientific article

    Statements

    Resource restricted computability theoretic learning: Illustrative topics and problems (English)
    0 references
    0 references
    19 October 2009
    0 references
    computability theoretic learning
    0 references
    fair polynomial time
    0 references
    memory limitations
    0 references
    optimality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers