Computability Theory(1st Edition)

Authors:

Rebecca Weber

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: $26.64 Savings: $26.64 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Computability Theory

Price:

$9.99

/month

Book details

ISBN: 082187392X, 978-0821873922

Book publisher: American Mathematical Society

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

Book Price $0 : What Can We Compute--even With Unlimited Resources? Is Everything Within Reach? Or Are Computations Necessarily Drastically Limited, Not Just In Practice, But Theoretically? These Questions Are At The Heart Of Computability Theory. The Goal Of This Book Is To Give The Reader A Firm Grounding In The Fundamentals Of Computability Theory And An Overview Of Currently Active Areas Of Research, Such As Reverse Mathematics And Algorithmic Randomness. Turing Machines And Partial Recursive Functions Are Explored In Detail, And Vital Tools And Concepts Including Coding, Uniformity, And Diagonalization Are Described Explicitly. From There The Material Continues With Universal Machines, The Halting Problem, Parametrization And The Recursion Theorem, And Thence To Computability For Sets, Enumerability, And Turing Reduction And Degrees. A Few More Advanced Topics Round Out The Book Before The Chapter On Areas Of Research. The Text Is Designed To Be Self-contained, With An Entire Chapter Of Preliminary Material Including Relations, Recursion, Induction, And Logical And Set Notation And Operators. That Background, Along With Ample Explanation, Examples, Exercises, And Suggestions For Further Reading, Make This Book Ideal For Independent Study Or Courses With Few Prerequisites.