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.
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter DG Plus DeG Package 2019 Part 1 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2019] ©2019 |
| Year of Publication: | 2019 |
| Language: | English |
| Series: | De Gruyter Series in Logic and Its Applications ,
9 |
| Online Access: | |
| Physical Description: | 1 online resource (VIII, 335 p.) :; Gleichungen: ca. 500 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Other title: | Frontmatter -- 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 |
|---|---|
| Summary: | 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. |
| Format: | Mode of access: Internet via World Wide Web. |
| ISBN: | 9783110496154 9783110762464 9783110719567 9783110616859 9783110610765 9783110664232 9783110610406 9783110606362 |
| ISSN: | 1438-1893 ; |
| DOI: | 10.1515/9783110496154 |
| Access: | restricted access |
| Hierarchical level: | Monograph |
| Statement of Responsibility: | Merlin Carl. |