We explain topological properties of the embedding-based approach to computability on topological spaces. With this approach, he considered a special kind of embedding of a topological space into Plotkin's $T^\omega$, which is the set of infinite sequences of $T = \{0,1,\bot \}$. We show that such an embedding can also be characterized by a dyadic subbase, which is a countable subbase $S = (S_0^0, S_0^1, S_1^0, S_1^1, \ldots)$ such that $S_n^j$ $(n = 0,1,2,\ldots; j = 0,1$ are regular open and $S_n^0$ and $S_n^1$ are exteriors of each other. We survey properties of dyadic subbases which are related to efficiency properties of the representation corresponding to the embedding.
@InProceedings{tsuiki:DagSemProc.04351.15, author = {Tsuiki, Hideki}, title = {{Dyadic Subbases and Representations of Topological Spaces}}, booktitle = {Spatial Representation: Discrete vs. Continuous Computational Models}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4351}, editor = {Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.15}, URN = {urn:nbn:de:0030-drops-1376}, doi = {10.4230/DagSemProc.04351.15}, annote = {Keywords: Dyadic subbase , embedding , computation over topological spaces , Plotkin's \$T^\backslashomega\$} }
Feedback for Dagstuhl Publishing