Charles Explorer logo
🇨🇿

Randomness in Computability Theory

Publikace na Matematicko-fyzikální fakulta |
2000

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

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.