Algorithmic Randomness for Infinite Time Register Machines
Logic
2026-05-19 v1
Abstract
A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-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.
Cite
@article{arxiv.1401.1734,
title = {Algorithmic Randomness for Infinite Time Register Machines},
author = {Merlin Carl},
journal= {arXiv preprint arXiv:1401.1734},
year = {2026}
}