Computability and randomness

@inproceedings{Nies2009ComputabilityAR,
  title={Computability and randomness},
  author={A. Nies},
  year={2009}
}
  • A. Nies
  • Published 2009
  • Mathematics
  • The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of… CONTINUE READING
    556 Citations
    The Mathematical Foundations of Randomness
    • 11
    • Highly Influenced
    • PDF
    Review of Algorithmic Randomness and Complexity by Downey and Hirschfeldt
    • PDF
    Randomness and Computability
    • 8
    • PDF
    Algorithmic Randomness and Measures of Complexity
    • 3
    Notions and applications of algorithmic randomness
    • Highly Influenced
    • PDF
    Around Kolmogorov complexity: basic notions and results
    • A. Shen
    • Computer Science, Mathematics
    • ArXiv
    • 2015
    • 23
    • PDF
    Mathematical Foundations of Randomness
    • 13
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 123 REFERENCES
    Comparing notions of randomness
    • 13
    • PDF
    Randomness, Computability, and Density
    • 31
    • PDF
    Algorithmic Randomness and Complexity
    • 763
    • PDF
    On the Notion of Randomness
    • 60
    Relativizing Chaitin's Halting Probability
    • 61
    • PDF
    Randomness, lowness and degrees
    • 31
    • PDF
    Trivial Reals
    • 94
    • PDF
    Using random sets as oracles
    • 101
    • PDF