124 search results - page 11 / 25 » Computational Effects in Topological Domain Theory |
ENTCS
2008
13 years 7 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
CIE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
SIAMCOMP
2008
13 years 7 months ago
2008
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...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
MEMOCODE
2008
IEEE
14 years 2 months ago
2008
IEEE
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...