Abstract Recursion and Intrinsic Complexity.
Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.
Saved in:
| Online Access: |
Full Text (via ProQuest) |
|---|---|
| Main Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2018.
|
| Series: | Lecture notes in logic.
|
| Subjects: |
Internet
Full Text (via ProQuest)Online
| Call Number: |
QA9.6 .M67 2019
|
|---|---|
| QA9.6 .M67 2019 | Available |