Randomness and differentiability
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z∈[0,1]z\in [0,1] is computably random if and only if each nondecreasing computable function [0,1]→R[0,1]\rightarrow \mathbb {R} is differentiable...
Saved in:
| Published in: | Transactions of the American Mathematical Society 2016-01, Vol.368 (1), p.581-605 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|