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.
Reihe
Sprache
Verlagsort
Zielgruppe
Illustrationen
6
10 s/w Tabellen, 6 s/w Abbildungen
6 b/w ill., 10 b/w tbl.Gleichungen: ca. 500
Dateigröße
ISBN-13
978-3-11-049291-0 (9783110492910)
Schweitzer Klassifikation
Merlin Carl, University of Konstanz, Germany.
