Algorithmic Randomness for Infinite Time Register Machines
classification
🧮 math.LO
keywords
randomnesscomputabilityinfinitemachinesregistertimealgorithmicanalogue
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.