Computational Dimension of Topological Spaces
Computational Dimension of Topological Spaces
复制标题
拓扑空间的计算维数
DOI:
10.1007/3-540-45335-0_19
复制
发表时间:
2000
期刊:
影响因子:
--
通讯作者:
H. Tsuiki
中科院分区:
文献类型:
--
作者:
H. Tsuiki
When a topological spaceXcan be embedded into the spaceΣ⊥,nw, ofn⊥-sequences ofΣ, then we can define the corresponding computational notion overXbecause a machine withn+1 heads on each tape can input/output sequences inΣ⊥,nw⋅. This means that the least numbernsuch thatXcan be topologically embedded intoΣ⊥,nwserves 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Σ⊥,nwisn, 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 universaln-dimensional space can be embedded intoΣ⊥,nwand 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 ℝ2can be embedded in {0,1}⊥,2wbut not inΣ⊥,1wfor any character setΣ, and infinite dimensional spaces like the set of closed/open/compact subsets ofIRmand the set of continuous functions from ℝlto ℝmcan be embedded inΣ⋅wbut not in:⊥,nwfor anyn.