19 search results - page 3 / 4 » mscs 2010 |
MSCS
2010
13 years 6 months ago
2010
tations of imperative abstract data types.
TSE
2010
13 years 2 months ago
2010
MSCS
2010
13 years 6 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
2010
13 years 6 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...
MSCS
2010
13 years 6 months ago
2010
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...