Computability 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. Beginning with an introduction to the mathematisation of “mechanical process” using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski’s theorem on the non-representability of truth, Goedel’s incompleteness and Rosser’s incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church’s thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum’s complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
“This textbook is suited for self-study …As a second reading however a reader interested in rigorous proofs and/or different approaches to known concepts will benefit from this wealth of material.” (Dieter Riebesehl, zbMATH 1507.03002, 2023)
George Tourlakis, PHD, is University Professor of Computer Science and Engineering at York University in Toronto, Canada. He has published extensively in his areas of research interest, which include calculational logic, modal logic, computability, and complexity theory. Dr. Tourlakis is the author of Theory of Computation and Mathematical Logic, both published by Wiley, and Lectures in Logic and Set Theory; Volumes 1 and 2 (Cambridge University Press).
| SKU | NGR9783030832049 |
| ISBN 13 | 9783030832049 |
| ISBN 10 | 303083204X |
| Title | Computability |
| Author | George Tourlakis |
| Condition | New |
| Binding Type | Paperback |
| Publisher | Springer Nature Switzerland AG |
| Year published | 2023-08-03 |
| Number of pages | 637 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time |
