Computability [E-Book] / by George Tourlakis.
This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing...
Saved in:
Full text |
|
Personal Name(s): | Tourlakis, George, author |
Edition: |
1st edition 2022. |
Imprint: |
Cham :
Springer,
2022
|
Physical Description: |
XXVII, 637 pages 12 illustrations, 10 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783030832025 |
DOI: |
10.1007/978-3-030-83202-5 |
Subject (LOC): |
- Mathematical Background; a Review
- A Theory of Computability
- Primitive Recursive Functions
- Loop Programs.-The Ackermann Function
- (Un)Computability via Church's Thesis
- Semi-Recursiveness
- Yet another number-theoretic characterisation of P
- Godel's Incompleteness Theorem via the Halting Problem
- The Recursion Theorem
- A Universal (non-PR) Function for PR
- Enumerations of Recursive and Semi-Recursive Sets
- Creative and Productive Sets Completeness
- Relativised Computability
- POSSIBILITY: Complexity of P Functions
- Complexity of PR Functions
- Turing Machines and NP-Completeness.