28 search results - page 2 / 6 » cie 2009 |
CIE
2009
Springer
13 years 8 months ago
2009
Springer
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
CIE
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to G¨odel’s functional (Dialectica) interpretation [3]. We consider the poss...
CIE
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...