CCA
2009
Springer
13 years 8 months ago
2009
Springer
CCA
2009
Springer
13 years 9 months ago
2009
Springer
d Abstract) Robert Rettinger1 and Xizhong Zheng2,3 1 Lehrgebiet Algorithmen und Komplexit
CCA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
CCA
2009
Springer
13 years 9 months ago
2009
Springer
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...
CCA
2009
Springer
13 years 9 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
CCA
2009
Springer
13 years 11 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
We extend the results of [2] by computing conformal maps onto the canonical slit domains in Nehari [14]. Along the way, we demonstrate the computability of solutions to Neuman prob...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
