Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262)

From MaRDI portal
Revision as of 14:48, 11 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
scientific article

    Statements

    Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (English)
    0 references
    0 references
    0 references
    9 January 2006
    0 references
    An algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis is presented in this paper. Main result: For any function \(f\) over the real numbers being 2-times continuously differentiable defined on a product of compact interval with rational endpoints, \(f\) is elementarily computable in the sense of recursive analysis if and only if \(f\) belongs to the smallest class of functions containing some basic functions and closed by composition, linear integration and a simple limit schema, and \(f\) is elementarily computable in the sense of recursive analysis in level \(n\geq 3\) of the Grzegorczyk hierarchy if and only if \(f\) belongs to the smallest class of functions containing some (other) basic functions and closed by composition, linear integration and a simple limit schema.
    0 references
    0 references
    analog computation
    0 references
    recursive analysis
    0 references
    real recursive functions
    0 references
    computability
    0 references
    Grzegorczyk hierarchy
    0 references
    0 references
    0 references