154 search results - page 30 / 31 » Cobham recursive set functions |
CIE
2010
Springer
13 years 9 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
LICS
1991
IEEE
13 years 9 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
NOMS
1998
IEEE
13 years 9 months ago
1998
IEEE
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
FPCA
1989
13 years 9 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a...