Computability-theoretic learning complexity (Q2941604): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q235644
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: John Case / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1098/rsta.2011.0320 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103396505 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q47604553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Gödel didn't have church's thesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chemical basis of morphogenesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / 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: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust separations in inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-limited non-U-shaped learning with solved open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity in generations of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary self-reference in learning 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: Q4115138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent and coherent learning with \(\delta \)-delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Five “Computable” Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Vacillation in Language Learning / rank
 
Normal rank

Latest revision as of 16:58, 10 July 2024

scientific article
Language Label Description Also known as
English
Computability-theoretic learning complexity
scientific article

    Statements

    Computability-theoretic learning complexity (English)
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    0 references
    computability-theoretic learning
    0 references
    self-reference
    0 references
    epitomizing success criteria
    0 references
    reducibilities and completeness
    0 references
    minds and machines
    0 references
    inductive inference
    0 references
    0 references
    0 references