HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
EUR 83,00
Anzahl: 1 verfügbar
In den WarenkorbHRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
EUR 91,01
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 74,52
Anzahl: 1 verfügbar
In den WarenkorbZustand: NEW.
Sprache: Englisch
Verlag: Springer, Berlin|Springer International Publishing|Springer, 2021
ISBN 10: 3030832015 ISBN 13: 9783030832018
Anbieter: moluna, Greven, Deutschland
Zustand: New. 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 invest.
EUR 146,78
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock.
Sprache: Englisch
Verlag: Springer International Publishing, Springer International Publishing, 2022
ISBN 10: 3030832015 ISBN 13: 9783030832018
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.