Westudycomplexhyperplanearrangementswhoseintersectionlattices,known as the Dowling lattices, are a natural generalization of the partition lattice. We give a combinatorial descript...
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
This paper describes a generic hypermedia model that is used as a framework for building context aware and mixed reality applications. It can handle different media elements, and ...
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...