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
Für Beruf und Forschung
US School Grade: College Graduate Student
Illustrationen
Gleichungen: ca. 500, 6 s/w Abbildungen, 10 s/w Tabellen
6 b/w ill., 10 b/w tbl.Gleichungen: ca. 500
Maße
Höhe: 246 mm
Breite: 175 mm
Dicke: 25 mm
Gewicht
ISBN-13
978-3-11-049562-1 (9783110495621)
Schweitzer Klassifikation
Merlin Carl
, University of Konstanz, Germany.
