Randomness and degree theory for infinite time register machines1
Merlin Carl · Computability · 2016
A concept of randomness for infinite time register machines (ITRMs) 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 Lambalge