|
16
|
An extension of the recursively enumerable Turing degrees
– Stephen G. Simpson
- 2006
|
|
17
|
Uniform almost everywhere domination
– Peter Cholak, Noam Greenberg, Joseph, S. Miller
- 2006
|
|
|
Reconciling Data Compression and . . .
– Laurent Bienvenu, Wolfgang Merkle
|
|
6
|
Effectively closed sets of measures and randomness
– Jan Reimann
|
|
16
|
A lower cone in the wtt degrees of non-integral effective dimension
– André Nies, Jan Reimann
- 2006
|
|
3
|
On the Structures Inside Truth-Table Degrees
– Frank Stephan
- 1997
|
|
4
|
Degrees of Computing and Learning
– Frank Stephan
- 1999
|
|
4
|
Lowness for weakly 1-generic and Kurtz-random
– Frank Stephan, Liang Yu
- 2006
|
|
1
|
Schnorr trivial sets and truth-table reducibility
– Johanna N. Y. Franklin, Frank Stephan
|
|
|
Interactions of Computability and Randomness
– André Nies
|
|
11
|
Complexity and Randomness
– Sebastiaan A. Terwijn
- 2003
|
|
12
|
Computability and Measure
– Sebastiaan Augustinus Terwijn
- 1998
|
|
1
|
Report: Bertelsmann wants all of Napster. http://www.usatoday.com/life/cyber/invest/2002/04/05/napster.htm
– Sanjay Jain, Frank Stephan, Nan Ye
- 2002
|
|
8
|
On the complexity of random strings (Extended Abstract)
– Martin Kummer
- 1996
|
|
3
|
RANDOMNESS NOTIONS AND PARTIAL RELATIVIZATION
– George Barmpalias, Joseph S. Miller, André Nies
|
|
|
Recursion Theory
– Frank Stephan
|
|
|
fixed on a
– Bernard A. Anderson
|
|
|
DEMUTH RANDOMNESS AND COMPUTATIONAL COMPLEXITY
– unknown authors
|
|
|
K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM
– George Barmpalias, Noam Greenberg, Antonio Montalb Án, Theodore, A. Slaman
|
