On the computational content of the Lawson topology (Q2500493)

We quote the well-written abstract almost verbatim: An element of an effectively given domain is computable if and only if its basic Scott open neighbourhoods are recursively enumerable. We thus refer to computable elements as Scott computable and define an element to be Lawson computable if its basic Lawson open neighborhoods are recursively enumerable. Since the Lawson topology is finer than the Scott topology, a stronger notion of computability is obtained. For example, in the powerset of the natural numbers with its standard effective presentation, an element is Scott computable if and only if it is a recursively enumerable set, and it is Lawson computable precisely when it is a recursive set. Among other examples, we consider the upper powerdomain of Euclidean space, for which we prove that Scott and Lawson computability coincide with two notions of computability proposed by \textit{V. Brattka} and \textit{K. Weihrauch} [Theor. Comput. Sci. 219, 65--93 (1999; Zbl 0916.68042)] in the framework of type-two recursion theory.