Sciweavers

318 search results - page 1 / 64
» Real Number Computability and Domain Theory
Sort
View
MFCS
1993
Springer
13 years 8 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio
ENTCS
2008
91views more  ENTCS 2008»
13 years 4 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
CIE
2005
Springer
13 years 6 months ago
Shrad: A Language for Sequential Real Number Computation
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...
Amin Farjudian
MST
2008
150views more  MST 2008»
13 years 4 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
CCA
2009
Springer
13 years 11 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler