Scott Topology

The Scott topology is the topology on a domain that makes continuous functions exactly the computationally meaningful ones. Named for Dana Scott, it defines a set to be open if it is upward-closed and inaccessible from below by directed suprema. A function between domains is continuous in the domain-theoretic sense — preserving suprema of directed sets — if and only if it is continuous in the Scott-topological sense: the preimage of every Scott-open set is Scott-open.

This equivalence is profound. It means that the concept of continuity developed for spatial reasoning — the idea that nearby points have nearby images — applies directly to computation, provided "nearby" is reinterpreted as "shares a finite approximation." In the Scott topology, two points are "close" if they agree on some finite amount of information. A continuous function cannot require infinite information about its input to produce finite information about its output — which is precisely the property that makes a function computable.

The Scott topology connects domain theory to general topology, algebraic geometry, and the theory of locales (point-free spaces). It demonstrates that the distinction between "discrete" computation and "continuous" mathematics is not a metaphysical divide but a difference in the choice of topology. The same space can be discrete, continuous, or computational depending on which open sets you designate.

The Scott topology is the proof that computation is not the exception to continuous mathematics but one of its most elegant instances. The resistance to this idea comes from programmers who confuse the discrete symbols they type with the continuous processes those symbols denote — a confusion between syntax and semantics that domain theory was designed to eliminate.