Complexity theory of real functions
Complexity theory of real functions
Action semantics
A New Characterization of Type-2 Feasibility
SIAM Journal on Computing
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
Computable analysis: an introduction
Computable analysis: an introduction
Resource-bounded continuity and sequentiality for type-two functionals
ACM Transactions on Computational Logic (TOCL)
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Semantics of a Sequential Language for Exact Real-Number Computation
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the non-sequential nature of the interval-domain model of real-number computation
Mathematical Structures in Computer Science
Implementing exact real arithmetic in python, C++ and C
Theoretical Computer Science - Real numbers and computers
The basic feasible functionals in computable analysis
Journal of Complexity
RealLib: An efficient implementation of exact real arithmetic
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper describes a type-1 framework for computable analysis designed to facilitate efficient implementations and discusses properties that have not been well studied before for type-1 approaches: the introduction of complexity measures for type-1 representations of real functions, and ways to define intensional functions, i.e. functions that may return different real numbers for the same real argument given in different representations. This approach has been used in a recently developed package for exact real number computations, which achieves performance comparable to the performance of machine precision floating point.