Abstract
When a topological space X can be embedded into the space Σ w⊥,n , of n⊥-sequences of Σ, then we can define the corresponding computational notion over X because a machine with n+1 heads on each tape can input/output sequences inΣ w⊥,n ⋅. This means that the least number n such that X can be topologically embedded into Σ w⊥, n serves as a degree of complexity of the space. We prove that this number, which we call the computational dimension of the space, is equal to the topological dimension for separable metric spaces. First, we show that the weak inductive dimension of Σ w⊥,n is n, and thus the computational dimension is at least as large as the weak inductive dimension for all spaces. Then, we show that the Nöbeling’s universal n-dimensional space can be embedded into Σ w⊥, n and thus the computational dimension is at most as large as the weak inductive dimension for separable metric spaces. As a corollary, the 2-dimensional Euclidean space ℝ2 can be embedded in {0,1} w⊥,2 but not in Σ w⊥,1 for any character set Σ, and infinite dimensional spaces like the set of closed/open/compact subsets of IR m and the set of continuous functions from ℝl to ℝm can be embedded in Σ w⋅ but not in : w⊥,n for any n.
Acknowledgement
The author thanks Andreas Knobel and Izumi Takeuti for many illuminating discussions, and anonymous referees for invaluable comments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vasco Brattka and Peter Hertling. Topological properties of real number representations. Theoretical Computer Science, 2000. to appear.
Jens Blanck. Domain representability of metric spaces. Annals of Pure and Applied Logic, 83:225–247, 1997.
Ryszard Engelking. Outline of General Topology. North-Holland, Amsterdam, 1968.
Ryszard Engelking. Dimension Theory. North-Holland, Amsterdam, 1978.
Abbas Edalat and Philipp Sünderhauf. A domain-theoretic approach to computability on the real line. Theoretical Computer Science, 210(1):73–98, 1998.
Pietro Di Gianantonio. An abstract data type for real numbers. Theoretical Computer Science, 221:295–326, 1999.
Witold Hurewicz and Henry Wallman. Dimension Theory. Princeton University Press, 1948.
Juniti Nagata. Modern Dimension Theory. North-Holland, Amsterdam, 1965.
Viggo Stoltenberg-Hansen and John V. Tucker. Concrete models of computation for topological algebras. Theoretical Computer Science, 219:347–378, 1999.
Hideki Tsuiki. Implementing real number computation in GHC. Computer Software (in Japanese), 2001. to appear.
Hideki Tsuiki. Real number computation through gray code embedding. Theoretical Computer Science, 2001. to appear.
Klaus Weihrauch. Computable Analysis, an Introduction. Springer-Verlag, Berlin, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsuiki, H. (2001). Computational Dimension of Topological Spaces. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-45335-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42197-9
Online ISBN: 978-3-540-45335-2
eBook Packages: Springer Book Archive