Inductive inference of recursive functions: Complexity bounds (Q4560353): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5685065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inference of Turing machines from sample computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank

Revision as of 16:15, 17 July 2024

scientific article; zbMATH DE number 6992064
Language Label Description Also known as
English
Inductive inference of recursive functions: Complexity bounds
scientific article; zbMATH DE number 6992064

    Statements

    Inductive inference of recursive functions: Complexity bounds (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2018
    0 references
    Turing machine
    0 references
    recursive function
    0 references
    inductive inference
    0 references
    finite automaton
    0 references
    prediction strategy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references