Free shipping on orders over $99
Turing Computability

Turing Computability

Theory and Applications

by Robert I. Soare
Hardback
Publication Date: 09/05/2016

Share This Book:

  $161.63
or 4 easy payments of $40.41 with
afterpay
This item qualifies your order for FREE DELIVERY
Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject.

Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part II includes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory.

The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.
ISBN:
9783642319327
9783642319327
Category:
Mathematical logic
Format:
Hardback
Publication Date:
09-05-2016
Language:
English
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Country of origin:
Germany
Pages:
263
Dimensions (mm):
235x155x18mm
Weight:
5.74kg

This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro  2 working days

NSW Metro  2 working days

NSW Rural  2 - 3 working days

NSW Remote  2 - 5 working days

NT Metro  3 - 6 working days

NT Remote  4 - 10 working days

QLD Metro  2 - 4 working days

QLD Rural  2 - 5 working days

QLD Remote  2 - 7 working days

SA Metro  2 - 5 working days

SA Rural  3 - 6 working days

SA Remote  3 - 7 working days

TAS Metro  3 - 6 working days

TAS Rural  3 - 6 working days

VIC Metro  2 - 3 working days

VIC Rural  2 - 4 working days

VIC Remote  2 - 5 working days

WA Metro  3 - 6 working days

WA Rural  4 - 8 working days

WA Remote  4 - 12 working days

Reviews

Be the first to review Turing Computability.