Dynamical systems, measures, and fractals via domain theory
Information and Computation
Selected papers of the workshop on Topology and completion in semantics
A computational model for metric spaces
Theoretical Computer Science
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A foundation for computation
Theoretical Computer Science - Topology in computer science
The regular spaces with countably based models
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
Hi-index | 5.23 |
As has been disclosed by K. Martin, a large number of important topological spaces do not have any continuous domain as their computational model. So it is of interest to study new kinds of pragmatic computational environments so as to model more topological spaces. In this paper we focus on bounded complete continuous posets with enough maximal points, which are shown to be a good choice for computational environments of Tychonoff spaces with no directed complete model. It is proved that the maximal point space of a Choquet complete weak domain is also Choquet complete. Furthermore, it is proved that X is a Tychonoff space iff X has a bounded complete weak domain environment. And it is also shown that Hausdorff compactifications of Tychonoff spaces can be realized via some of their computational environments.