Contact
How to shop
Delivery
Shopping guide
Computability
English
239 b
Up to 30 days for returns
Customers also purchased
/
Paperback
35 232
Ft
/
Hardback
4 564
Ft
/
Paperback
4 640
Ft
/
Paperback
4 774
Ft
/
Paperback
24 551
Ft
/
Paperback
3 654
Ft
/
Paperback
15 184
Ft
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, Oracle computations 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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
8 928
Ft
/
Paperback
4 502
Ft
