Ordinal Computability
An Introduction to Infinitary Machines
1st Edition
Published on 23. September 2019
VIII, 335 pages
978-3-11-049615-4 (ISBN)
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.
More details
Other editions
Additional editions
Book
02/2024
1st Edition
De Gruyter
€149.95
Shipment within 7-9 days
E-Book
09/2019
1st Edition
De Gruyter
€149.95
Available for download
Person
Merlin Carl
, University of Konstanz, Germany.
Content
- Intro
- Contents
- 1. Introduction
- 2. Machine models of transfinite computability
- 3. Computability strength
- 4. Recognizability
- 5. Randomness
- 6. Degree theory
- 7. Complexity
- 8. Applications and interactions
- 9. Philosophical aspects
- Bibliography
- Index
- De Gruyter Series in Logic and Its Applications
