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.
| Autor: | Carl, Merlin |
|---|---|
| ISBN: | 9783110495621 |
| Auflage: | 1 |
| Sprache: | Englisch |
| Seitenzahl: | 335 |
| Produktart: | Gebunden |
| Verlag: | De Gruyter |
| Veröffentlicht: | 23.09.2019 |
| Untertitel: | An Introduction to Infinitary Machines |
| Schlagworte: | Berechenbarkeit Registermaschine Turing-Maschine |
Merlin Carl, University of Konstanz, Germany.