Abstract

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 show that this number, which we call the computational dimension of the space, is equal to the topological dimension for separable metric spaces. As a corollary, the 2-dimensional Euclidean space IR 2 can be embedded in f0; 1g ! ?;2 but not in ! ?;1 for any character set , and infinite dimensional spaces like the set of closed/open/compact subsets of IR n and the set of continuous functions from IR n to IR m can be embedded in ! ? but not in ! ?;n for any n.

Citations