Sciweavers

Share
CIE
2009
Springer
9 years 2 months ago
Numberings and Randomness
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...
Paul Brodhead, Bjørn Kjos-Hanssen
CIE
2009
Springer
9 years 2 months ago
On Generating Independent Random Strings
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...
Marius Zimand
CIE
2009
Springer
9 years 2 months ago
On Stateless Multicounter Machines
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...
Ömer Egecioglu, Oscar H. Ibarra
CIE
2009
Springer
9 years 2 months ago
Members of Random Closed Sets
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...
David Diamondstone, Bjørn Kjos-Hanssen
CIE
2009
Springer
9 years 2 months ago
First-Order Universality for Real Programs
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...
Thomas Anberrée
CIE
2009
Springer
9 years 2 months ago
Stability under Strategy Switching
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...
Soumya Paul, Ramaswamy Ramanujam, Sunil Easaw Simo...
books