69 search results - page 11 / 14 » mscs 2006 |
101
click to vote
MSCS
2010
14 years 7 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
MSCS
2006
14 years 9 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
MSCS
2006
14 years 9 months ago
2006
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
MSCS
1998
14 years 9 months ago
1998
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
MSCS
2010
14 years 7 months ago
2010
Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in which every guarded system of recursive equations has a unique solution. For every ideal mon...