CIE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
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
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...