Algorithmic Randomness for Infinite Time Register Machines
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2014
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910229909733376 |
|---|---|
| author | Carl, Merlin |
| author_facet | Carl, Merlin |
| contents | A concept of randomness for infinite time register machines (ITRMs), resembling Martin-Löf-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of van Lambalgen's theorem holds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1401_1734 |
| institution | arXiv |
| publishDate | 2014 |
| record_format | arxiv |
| spellingShingle | Algorithmic Randomness for Infinite Time Register Machines Carl, Merlin Logic A concept of randomness for infinite time register machines (ITRMs), resembling Martin-Löf-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of van Lambalgen's theorem holds. |
| title | Algorithmic Randomness for Infinite Time Register Machines |
| topic | Logic |
| url | https://arxiv.org/abs/1401.1734 |