Ordinal Computability : An Introduction to Infinitary Machines (De Gruyter Series in Logic and Its Applications 9) (2019. VIII, 335 S. 6 b/w ill., 10 b/w tbl., Gleichungen: ca. 500. 240)

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.