On the complexity of online computations of real functions (Q1186506): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type 2 recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3722498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type 2 computational complexity of functions on Cantor's space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3788007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with infinite objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3966120 / rank
 
Normal rank

Latest revision as of 16:06, 15 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of online computations of real functions
scientific article

    Statements

    On the complexity of online computations of real functions (English)
    0 references
    28 June 1992
    0 references
    computational complexity for real functions
    0 references
    modified infinite binary representations
    0 references
    Turing machines
    0 references
    input lookahead
    0 references
    0 references

    Identifiers