Computability
Computable analysis: an introduction
Computable analysis: an introduction
Real functions computable by finite automata using affine representations
Theoretical Computer Science
Real number computation through gray code embedding
Theoretical Computer Science
Computational Dimension of Topological Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Standard Representations of Effective Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Theoretical Computer Science - Topology in computer science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Real numbers and computers
Revising Type-2 Computation and Degrees of Discontinuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
A Stream Calculus of Bottomed Sequences for Real Number Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 5.23 |
We prove three results about representations of real numbers (or elements of other topological spaces) by infinite strings. Such representations are useful for the description of real number computations performed by digital computers or by Turing machines. First, we show that the so-called admissible representations, a topologically natural class of representations introduced by Kreitz and Weihrauch, are essentially the continuous extensions (with a well-behaved domain) of continuous and open representations. Second, we show that there is no admissible representation of the real numbers such that every real number has only finitely many names. Third, we show that a rather interesting property of admissible real number representations holds true also for a certain non-admissible representation, namely for the naive Cauchy representation: the property that continuity is equivalent to relative continuity with respect to the representation.