• Publications
  • Influence
Randomness, relativization and Turing degrees
TLDR
We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) ≥ ∣x∣ − c. Expand
  • 144
  • 26
  • PDF
Computational randomness and lowness*
TLDR
We prove that there are uncountably many sets that are low for the class of Schnorr random reals that have Turing degree incomparable to 0′. Expand
  • 98
  • 15
On partial randomness
TLDR
We study the degree of randomness of sequences or reals by measuring their “degree o fc ompression”. Expand
  • 73
  • 8
  • PDF
Lowness for The Class of Random Sets
TLDR
A positive answer to a question of M. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Expand
  • 82
  • 7
Resource Bounded Randomness and Weakly Complete Problems
TLDR
We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ([5, 6]). Expand
  • 50
  • 7
Computability and measure
  • 45
  • 7
Genericity and Measure for Exponential Time
TLDR
We show that, for any c 3 1, the class of n’-generic sets has p-measure 1.0415. Expand
  • 56
  • 3
  • PDF
Resource Bounded Randomness and Weakly Complete Problems
TLDR
We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ([5, 6]). Expand
  • 50
  • 3
Calibrating Randomness
TLDR
G. J. Chaitin, A theory of program size formally identical to information theory, J. Mach. Expand
  • 70
  • 3
  • PDF
Probabilistic Logic and Induction
  • S. Terwijn
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1 August 2005
TLDR
We give a probabilistic interpretation of first-order formulas based on Valiants model of pac-learning and take some first steps in developing its model theory. Expand
  • 10
  • 3
  • PDF
...
1
2
3
4
5
...