2014/01/08 by Merlin Carl, Carl, Merlin · 1 citation
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
paper · doi:10.48550/arxiv.1401.1734
openalex publication_date 2014/01/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.