George Tourlakis: Computability | Buch

Um unseren Shop nutzen zu können, müssen Sie Javascript in Ihrem Browser aktivieren.

Cover: 9783030832018 | Computability | George Tourlakis | Buch | HC runder Rücken kaschiert

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

97,15 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Sie können kein Produkt in den Warenkorb legen, da Javascript und technisch notwendige Cookies aktiviert sein müssen.

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Über den Autor

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).

Zusammenfassung

Features extensive and mathematically complete coverage of limitations of logic

Explains the inability of computability to effectively detect formal theorems

Provides arithmetisation-free proofs of the pillars of computability

Inhaltsverzeichnis

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.

Details

Erscheinungsjahr:	2022
Genre:	Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Seiten:	668
Inhalt:	xxvii 637 S. 2 s/w Illustr. 10 farbige Illustr. 637 p. 12 illus. 10 illus. in color.
ISBN-13:	9783030832018
ISBN-10:	3030832015
Sprache:	Englisch
Ausstattung / Beilage:	HC runder Rücken kaschiert
Einband:	Gebunden
Autor:	Tourlakis, George
Auflage:	1st ed. 2022
Hersteller:	Springer International Publishing
Maße:	241 x 160 x 42 mm
Von/Mit:	George Tourlakis
Erscheinungsdatum:	03.08.2022
Gewicht:	1,156 kg

preigu-id: 120305573