Computational Dimension of Topological Spaces

When a topological space X can be embedded into the space ?;?,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 ?;?,n?. This means that the least number n such that X can be topologically embedded into ?;?,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 ?;?,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 Nobeling's universal n-dimensional space can be embedded into ?;?,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 R2 can be embedded in {0, 1}?,2? but not in ?;?,1? for any character set ?, and infinite dimensional spaces like the set of closed/open/compact subsets of Rm and the set of continuous functions from Rl to Rm can be embedded in ?;?? but not in ?;?,n? for any n.