Notions and applications of algorithmic randomness
Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy, focussing in particular on Martin-Lof randomn...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Leeds
2013
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581702 |