Sciweavers

Share
STACS
2012
Springer
7 years 2 months ago
The Denjoy alternative for computable functions
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...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
AML
2011
177views Mathematics» more  AML 2011»
8 years 2 months ago
A superhigh diamond in the c.e. tt-degrees
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...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...
FUIN
2002
109views more  FUIN 2002»
8 years 7 months ago
Another Example of Higher Order Randomness
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
Verónica Becher, Gregory J. Chaitin
SOFSEM
2009
Springer
8 years 11 months ago
Randomness and Determination, from Physics and Computing towards Biology
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 ...
Giuseppe Longo
books