Real recursive functions and their hierarchy
DOI10.1016/J.JCO.2004.06.001zbMATH Open1085.03030OpenAlexW2168711698MaRDI QIDQ706790FDOQ706790
Authors: Jerzy Mycka, José Félix Costa 
Publication date: 9 February 2005
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2004.06.001
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65) Turing machines and related notions (03D10)
Cites Work
- Non-Turing computations via Malament--Hogarth space-times
- The extended analog computer
- The existence of noncollision singularities in Newtonian systems
- Recursion theory on the reals and continuous-time computation
- Analog computers and recursive functions over the reals.
- Title not available (Why is that?)
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Mathematical Theory of the Differential Analyzer
- Classical recursion theory. Vol. II
- Small universal Turing machines
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Arithmetical Predicates and Function Quantifiers
- Some mathematical limitations of the general-purpose analog computer
- Equality is a jump
- \(\mu\)-recursion and infinite limits.
- An analog characterization of the Grzegorczyk hierarchy
- A Differentially Algebraic Replacement Theorem, and Analog Computability
- Title not available (Why is that?)
- On the role of mathematics and mathematical knowledge in the invention of Vannevar Bush's early analog computers
- Iteration, inequalities, and differentiability in analog computers
Cited In (26)
- Title not available (Why is that?)
- A Survey on Analog Models of Computation
- Differential recursion
- Machines, Computations, and Universality
- Computability of analog networks
- Computability on reals, infinite limits and differential equations
- \(\mu\)-recursion and infinite limits.
- A survey of recursive analysis and Moore's notion of real computation
- Real recursive functions and Baire classes
- The elementary computable functions over the real numbers: applying two new techniques
- A foundation for real recursive function theory
- Hierarchies of function classes defined by the first-value operator
- A new conceptual framework for analog computation
- Recursive analysis characterized as a class of real recursive functions
- Recursive Functions and Constructive Mathematics
- How much can analog and hybrid systems be proved (super-)Turing
- The New Promise of Analog Computation
- Computability with polynomial differential equations
- Title not available (Why is that?)
- Continuous-time computation with restricted integration capabilities
- The influence of domain interpretations on computational models
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Analog computation beyond the Turing limit
- Polynomial differential equations compute all real computable functions on computable compact intervals
- A hypercomputational alien
This page was built for publication: Real recursive functions and their hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706790)
