Ordinal Computability

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.

Merlin Carl, University of Konstanz, Germany.

Weitere Produkte vom selben Autor

Download
PDF
Ordinal Computability Merlin Carl

129,95 €*