CIE
2005
Springer
14 years 25 days ago
2005
Springer
CIE
2005
Springer
14 years 25 days ago
2005
Springer
CIE
2005
Springer
14 years 25 days ago
2005
Springer
Since Di Gianantonio [1993] introduced his semantics for exact real omputation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. T...
CIE
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for e...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
CIE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...