Charles Explorer logo
🇬🇧

Randomness in Computability Theory

Publication at Faculty of Mathematics and Physics |
2000

Abstract

We discuss some aspects of algorithmic randomness and state some open problems in this area. The first part is devoted to the question 'What is a computably random sequence?' Here we survey some of the approaches to algorithmic randomness.