What is a computable set? One may call a bounded subset of the plane computable if it can be drawn at any resolution on a computer screen. Using the constructive approach to computability one naturally considers totally bounded subsets of the plane. We connect this notion with notions introduced in other frameworks. A subset of a totally bounded set is again totally bounded iff it is located. L...

There is a natural bijective correspondence between the compactifications of a Tychonoff space X, the totally bounded uniformities on X, and the unital C∗-subalgebras of C∗(X) (the algebra of bounded continuous complex valued functions on X) with what we call the completely regular separation property. The correspondence of compactifications with totally bounded uniformities is well know and ca...

A totally odd H-subdivision means a subdivision of a graph H in which each edge of H corresponds to a path of odd length. Thus this concept is a generalization of a subdivision of H. In this paper, we give a structure theorem for graphs without a fixed graph H as a totally odd subdivision. Namely, every graph with no totally odd H-subdivision has a tree-decomposition such that each piece is eit...