Results 1  10
of
22
A DomainTheoretic Approach to Computability on the Real Line
, 1997
"... In recent years, there has been a considerable amount of work on using continuous domains in real analysis. Most notably are the development of the generalized Riemann integral with applications in fractal geometry, several extensions of the programming language PCF with a real number data type, and ..."
Abstract

Cited by 43 (8 self)
 Add to MetaCart
In recent years, there has been a considerable amount of work on using continuous domains in real analysis. Most notably are the development of the generalized Riemann integral with applications in fractal geometry, several extensions of the programming language PCF with a real number data type, and a framework and an implementation of a package for exact real number arithmetic. Based on recursion theory we present here a precise and direct formulation of effective representation of real numbers by continuous domains, which is equivalent to the representation of real numbers by algebraic domains as in the work of StoltenbergHansen and Tucker. We use basic ingredients of an effective theory of continuous domains to spell out notions of computability for the reals and for functions on the real line. We prove directly that our approach is equivalent to the established Turingmachine based approach which dates back to Grzegorczyk and Lacombe, is used by PourEl & Richards in their found...
Foundation of a Computable Solid Modelling
 Theoretical Computer Science
, 2002
"... Solid modelling and computational geometry are based on classical topology and geometry in which the basic predicates and operations, such as membership, subset inclusion, union and intersection, are not continuous and therefore not computable. But a sound computational framework for solids and g ..."
Abstract

Cited by 33 (13 self)
 Add to MetaCart
Solid modelling and computational geometry are based on classical topology and geometry in which the basic predicates and operations, such as membership, subset inclusion, union and intersection, are not continuous and therefore not computable. But a sound computational framework for solids and geometry can only be built in a framework with computable predicates and operations. In practice, correctness of algorithms in computational geometry is usually proved using the unrealistic Real RAM machine model of computation, which allows comparison of real numbers, with the undesirable result that correct algorithms, when implemented, turn into unreliable programs. Here, we use a domaintheoretic approach to recursive analysis to develop the basis of an eective and realistic framework for solid modelling. This framework is equipped with a welldened and realistic notion of computability which reects the observable properties of real solids. The basic predicates and operations o...
The iRRAM: Exact Arithmetic in C++
"... The iRRAM is a very efficient C++ package for errorfree real arithmetic based on the concept of a RealRAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation. ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
The iRRAM is a very efficient C++ package for errorfree real arithmetic based on the concept of a RealRAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.
Computable Banach Spaces via Domain Theory
 Theoretical Computer Science
, 1998
"... This paper extends the ordertheoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to define a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of clos ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper extends the ordertheoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to define a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those which map computable sequences to computable sequences and are effectively bounded. We show that the domaintheoretic computability theory is equivalent to the wellestablished approach by PourEl and Richards. 1 Introduction This paper is part of a programme to introduce the theory of continuous domains as a new approach to computable analysis. Initiated by the various applications of continuous domain theory to modelling classical mathematical spaces and performing computations as outlined in the recent survey paper by Edalat [6], the authors started this work with [9] which was concerned with co...
The Convex Hull in a New Model of Computation
 In Proc. 13th Canad. Conf. Comput. Geom
, 2001
"... We present a new model of geometric computation which supports the design of robust algorithms for exact real number input as well as for input with uncertainty, i.e. partial input. In this framework, we show that the convex hull of N computable real points in R^d is indeed computable. We provide a ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We present a new model of geometric computation which supports the design of robust algorithms for exact real number input as well as for input with uncertainty, i.e. partial input. In this framework, we show that the convex hull of N computable real points in R^d is indeed computable. We provide a robust algorithm which, given any set of N partial inputs, i.e. N dyadic or rational rectangles, approximating these points, computes the partial convex hull in time O(N log N) in 2d and 3d. As the rectangles are refined to the N points, the sequence of partial convex hulls converges effectively both in the Hausdorff metric and the Lebesgue measure to the convex hull of the N points.
Is the Mandelbrot set computable?
 MATH. LOGIC QUART
, 2005
"... We discuss the question whether the Mandelbrot set is computable. The computability notions which we consider are studied in computable analysis and will be introduced and discussed. We show that the exterior of the Mandelbrot set, the boundary of the Mandelbrot set, and the hyperbolic components sa ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We discuss the question whether the Mandelbrot set is computable. The computability notions which we consider are studied in computable analysis and will be introduced and discussed. We show that the exterior of the Mandelbrot set, the boundary of the Mandelbrot set, and the hyperbolic components satisfy certain natural computability conditions. We conclude that the two–sided distance function of the Mandelbrot set is computable if the hyperbolicity conjecture is true. We formulate the question whether the distance function of the Mandelbrot set is computable also in terms of the escape time.
Attribute Grammars and Monadic Second Order Logic
, 1996
"... It is shown that formulas in monadic second order logic (mso) with one free variable can be mimicked by attribute grammars with a designated boolean attribute and vice versa. We prove that mso formulas with two free variables have the same power in defining binary relations on nodes of a tree as reg ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
It is shown that formulas in monadic second order logic (mso) with one free variable can be mimicked by attribute grammars with a designated boolean attribute and vice versa. We prove that mso formulas with two free variables have the same power in defining binary relations on nodes of a tree as regular path languages have. For graphs in general, mso formulas turn out to be stronger. We also compare path languages against the routing languages of Klarlund and Schwartzbach. We compute the complexity of evaluating mso formulas with free variables, especially in the case where there is a dependency between free variables of the formula. Last, it is proven that mso tree transducers have the same strength as attributed tree transducers with the single use requirement and flags.
Formalisation of Computability of Operators and RealValued Functionals via Domain Theory
 Proceedings of CCA2000
"... Based on an eective theory of continuous domains, notions of computability for operators and realvalued functionals dened on the class of continuous functions are introduced. Denability and semantic characterisation of computable functionals are given. Also we propose a recursion scheme which is a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Based on an eective theory of continuous domains, notions of computability for operators and realvalued functionals dened on the class of continuous functions are introduced. Denability and semantic characterisation of computable functionals are given. Also we propose a recursion scheme which is a suitable tool for formalisation of complex systems, such as hybrid systems. In this framework the trajectories of continuous parts of hybrid systems can be represented by computable functionals. 1
Semantic Characterisations of Secondorder Computability Over the Real Numbers
 LNCS
, 2001
"... We propose semantic characterisations of secondorder computability over the reals based on denability theory. Notions of computability for operators and realvalued functionals dened on the class of continuous functions are introduced via domain theory. We consider the reals with and without equal ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We propose semantic characterisations of secondorder computability over the reals based on denability theory. Notions of computability for operators and realvalued functionals dened on the class of continuous functions are introduced via domain theory. We consider the reals with and without equality and prove theorems which connect computable operators and realvalued functionals with validity of nite formulas. 1