Computability(1st Edition)

Authors:

George Tourlakis

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 2 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $70.01 Savings: $70.01 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Computability

Price:

$9.99

/month

Book details

ISBN: 3030832015, 978-3030832018

Book publisher: Springer

Offer Just for You!: Buy 2 books before the end of January and enter our lucky draw.

Book Price $0 : 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.