Feasible reductions to kolmogorov-loveland stochastic sequences

This publication has 20 references indexed in Scilit:

• Equivalence of measures of complexity classes
  Published by Springer Nature ,1997
• On Languages Reducible to Algorithmically Random Languages
  SIAM Journal on Computing, 1994
• Computational depth and reducibility
  Theoretical Computer Science, 1994
• An observation on probability versus randomness with applications to complexity classes
  Theory of Computing Systems, 1994
• A guided tour of chernoff bounds
  Information Processing Letters, 1990
• Incompleteness theorems for random reals
  Advances in Applied Mathematics, 1987
• Every sequence is reducible to a random one
  Information and Control, 1986
• Combinatorial foundations of information theory and the calculus of probabilities
  Russian Mathematical Surveys, 1983
• A Theory of Program Size Formally Identical to Information Theory
  Journal of the ACM, 1975
• On the concept of a random sequence
  Bulletin of the American Mathematical Society, 1940