Ordinal computability : an introduction to infinitary machines
Author(s)
Bibliographic Information
Ordinal computability : an introduction to infinitary machines
(De Gruyter series in logic and its applications, v. 9)
De Gruyter, c2019
Available at / 4 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [313]-321) and index
Description and Table of Contents
Description
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.
by "Nielsen BookData"