Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines, register machines or lambda-calculus to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics, including set theory and model theory, are covered.weiterlesen