Ordinal Computability: An Introduction to Infinitary Machines
Merlin Carl
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.
Κατηγορίες:
Έτος:
2019
Εκδότης:
de Gruyter
Γλώσσα:
english
Σελίδες:
343
ISBN 10:
3110496151
ISBN 13:
9783110496154
Σειρές:
De Gruyter Series in Logic and Its Applications 9
Αρχείο:
PDF, 4.10 MB
IPFS:
,
english, 2019