Complexity and Intensionality in a Type-1 Framework for Computable Analysis

Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic implemented in hardware. This performance problem is to a very large extent due to the type-2 nature of the computable analysis frameworks usually employed. This problem can be overcome by employing a type-1 approach. This paper presents such an approach and deals with properties of it that

• Type: Conference
• Year: 2005
• Where: CSL
• Authors: Branimir Lambov
• Keywords: Computable Analysis Frameworks, CSL 2005, Real Number Computations, Type-1 Approach