Beschreibung
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.
Autorenporträt
Merlin Carl, University of Konstanz, Germany.
Herstellerkennzeichnung:
Walter de Gruyter GmbH
De Gruyter GmbH
Genthiner Strasse 13
10785 Berlin
DE
E-Mail: productsafety@degruyterbrill.com
