- Bliv medlem
-
Du er ikke logget ind
Log ind Opret dig
Du er ikke logget ind
Beskrivelse
Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.