STACS
2012
Springer
12 years 15 days ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
AML
2011
12 years 12 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
FUIN
2002
13 years 4 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
SOFSEM
2009
Springer
13 years 9 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...