Computability theory (Record no. 1639)

000 -LEADER
fixed length control field 01827nam a2200205Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240830124451.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180205s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781470425944
040 ## - CATALOGING SOURCE
Original cataloging agency ICTS-TIFR
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA9.6
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Weber, Rebecca
245 ## - TITLE STATEMENT
Title Computability theory
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Name of publisher, distributor, etc. AMS,
Date of publication, distribution, etc. [c2012]
Place of publication, distribution, etc. Rhode Island:
300 ## - Physical Description
Pages: 203 p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Chapter 1. Introduction<br/>Chapter 2. Background<br/>Chapter 3. Defining computability<br/>Chapter 4. Working with computable functions<br/>Chapter 5. Computing and enumerating sets<br/>Chapter 6. Turing reduction and Post’s problem<br/>Chapter 7. Two hierarchies of sets<br/>Chapter 8. Further tools and results<br/>Chapter 9. Areas of research<br/>
520 ## - SUMMARY, ETC.
Summary, etc. 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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Book
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Shelving location Date acquired Full call number Accession No. Koha item type
          ICTS Rack No 3 01/18/2018 QA9.6 00899 Book