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
Издание:
1
Издателство:
De Gruyter
Език:
english
Страници:
212
ISBN 10:
3110495627
ISBN 13:
9783110495621
Серия:
De Gruyter Series in Logic and Its Applications
Файл:
PDF, 4.29 MB
IPFS:
,
english, 2019