Computability - George Tourlakis

Computability

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. Les mer
Vår pris
1350,-

(Innbundet) Fri frakt!
Leveringstid: Sendes innen 7 virkedager

Innbundet
Legg i
Innbundet
Legg i
Vår pris: 1350,-

(Innbundet) Fri frakt!
Leveringstid: Sendes innen 7 virkedager

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.
FAKTA
Utgitt:
Forlag: Springer Nature Switzerland AG
Innbinding: Innbundet
Språk: Engelsk
Sider: 637
ISBN: 9783030832018
Format: 24 x 16 cm
KATEGORIER:

Bla i alle kategorier

VURDERING
Gi vurdering
Les vurderinger
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.
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).