{"product_id":"computability-9783030832018","title":"Computability","description":"\u003cp\u003e\u003c\/p\u003e\u003cblockquote\u003eThis survey of computability theory provides techniques and tools to analyze computational processes and investigate theoretical limitations, covering basic theory, advanced topics, and applications. \u003c\/blockquote\u003e\u003cp\u003e\u003cstrong\u003eFormat\u003c\/strong\u003e: Hardback\u003cbr\u003e\u003cstrong\u003eLength\u003c\/strong\u003e: 637 pages\u003cbr\u003e\u003cstrong\u003ePublication date\u003c\/strong\u003e: 03 August 2022\u003cbr\u003e\u003cstrong\u003ePublisher\u003c\/strong\u003e: Springer Nature Switzerland AG\u003cbr\u003e\u003c\/p\u003e \u003cp\u003e\u003cbr\u003eThis comprehensive survey of computability theory provides computer scientists, mathematicians, and philosophers studying the mathematical foundations of computing with the essential techniques and tools to mathematically analyze computational processes and investigate the theoretical limitations of computing. The textbook begins by introducing the mathematization of \"mechanical processes\" through Universal Recursive Modelling (URM) programs, laying the foundation for fundamental concepts such as primitive recursive functions and predicates, sequence-coding, partial recursive functions and predicates, and loop programs. As the survey progresses, advanced chapters delve into topics such as the Ackerman function, Tarskis theorem on the non-representability of truth, Goedels incompleteness and Rosser's incompleteness theorems, two concise proofs of the incompleteness theorem utilizing Lob's deliverability conditions, Church's thesis, the second recursion theorem, applications, a provably recursive universal function for primitive recursive functions, Oracle computations, various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees, and the priority method. These chapters offer a thorough exposition of various versions of the first recursive theorem, Blums complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. By encompassing a wide range of topics, this survey serves as a valuable resource for scholars seeking to deepen their understanding of computability theory and its applications in the fields of computer science, mathematics, and philosophy.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eWeight\u003c\/strong\u003e: 1132g\u003cbr\u003e\u003cstrong\u003eDimension\u003c\/strong\u003e: 161 x 244 x 47 (mm)\u003cbr\u003e\u003cstrong\u003eISBN-13\u003c\/strong\u003e: 9783030832018\u003cbr\u003e \u003cstrong\u003eEdition number\u003c\/strong\u003e: 1st ed. 2022\u003c\/p\u003e","brand":"George Tourlakis","offers":[{"title":"Hardback","offer_id":44102876791034,"sku":"9783030832018","price":68.31,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/products\/1661527590522_book.jpg?v=1661605900","url":"https:\/\/shulphink.com\/products\/computability-9783030832018","provider":"Shulph Ink","version":"1.0","type":"link"}