Computability, domains, topology

Jens Blanck


Domains are partially ordered structures that have a natural computability
theory. From another perspective, domain theory is a theory of approximations
and domains are therefore useful as representations of uncountable spaces.
Thus, there is an obvious connection from computability to topology via

Total domain elements may be seen as representations (or realisers) of points
in the topological space while the finite (compact) objects of a domain often
retain countability allowing computations to be performed on the domains.

We will look at the basic framework, with basic examples including metric
spaces, and discuss how to recognise good domain representations.
Tuesday 6th February 2007, 14:00
Robert Recorde Room
Department of Computer Science