Algorithmic Randomness for Infinite Time Register Machines
arXiv:1401.1734 · doi:10.1007/978-3-319-08019-2_9
Abstract
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.