A foundation for real recursive function theory

DOI10.1016/J.APAL.2009.01.013zbMath1189.03047OpenAlexW2049452137MaRDI QIDQ1032628

Jerzy Mycka, Bruno Loff, Costa, José Félix

Publication date: 26 October 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/17964

zbMATH Keywords

computability on realsreal recursive functionsinfinite limitsdifferential recursion

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Computation over the reals, computable analysis (03D78)

Related Items (4)

Incomputability in Physics and Biology ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Real recursive functions and their hierarchy
• The elementary computable functions over the real numbers: applying two new techniques
• Computability on reals, infinite limits and differential equations
• A new conceptual framework for analog computation
• Classical recursion theory. The theory of functions and sets of natural numbers
• A new recursion-theoretic characterization of the polytime functions
• Recursion theory on the reals and continuous-time computation
• \(\mu\)-recursion and infinite limits.
• Analog computers and recursive functions over the reals.
• An analog characterization of the Grzegorczyk hierarchy
• Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18--23, 2007. Proceedings.
• 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
• Undecidability over Continuous Time
• Simplifications of the recursion scheme
• Machines, Computations, and Universality
• New Computational Paradigms
• Iteration, inequalities, and differentiability in analog computers

This page was built for publication: A foundation for real recursive function theory