2436 search results - page 13 / 488 » Comonadic Notions of Computation |
JC
2006
13 years 7 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
TAL
2010
Springer
13 years 2 months ago
2010
Springer
This paper provides a linguistic semantic analysis of time and aspect in natural languages. On the basis of topological concepts, notions are introduced like the basic aspectual op...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...