A characterization of computable analysis on unbounded domains using differential equations (Q719239): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ic.2011.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147410830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial differential equations compute all real computable functions on computable compact intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive characterization of computable real-valued functions and relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible real random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog characterization of the Grzegorczyk hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Approximation to Relate Computational Classes over the Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Computable Analysis with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elementary computable functions over the real numbers: applying two new techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A foundation for real recursive function theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A domain-theoretic approach to computability on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computers and recursive functions over the reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability, noncomputability and undecidability of maximal intervals of IVPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theory on the reals and continuous-time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Theory of the Differential Analyzer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 11:46, 4 July 2024

scientific article
Language Label Description Also known as
English
A characterization of computable analysis on unbounded domains using differential equations
scientific article

    Statements

    A characterization of computable analysis on unbounded domains using differential equations (English)
    0 references
    10 October 2011
    0 references
    computable analysis
    0 references
    real recursive functions
    0 references
    function algebras
    0 references
    analog computation
    0 references
    differential equations
    0 references
    approximation
    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