Enderton, Herbert B.
Computability Theory: An Introduction to Recursion Theory
### ISBN 13: 9780123849588

"Computability Theory: An Introduction to Recursion Theory", provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. "Computability Theory" is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory.

*"synopsis" may belong to another edition of this title.*

"This textbook on basic computability theory is at the upper-undergraduate level."--Zentralblatt MATH 2012-1243-03057 "Enderton (U. of California, Los Angeles) has written a clear, focused, and surprisingly literate textbook - it is a rare mathematician who is this adept with words - describing the history and theory of recursion theory that will be ideal for one-semester advanced courses in mathematics and computer science. After the concepts and theories are introduced, the equivalence of computable partial function and recursive partial function are demonstrated, in part through proofs of the unsolvability of the halting problem and of the enumeration theorem. Other chapters describe the properties of recursively enumerable sets, the link between computability theory and G del's incompleteness theorem, relative computability and degrees of unsolvability, and polynomial time computability. Appendices are included on Mathspeak, countability, and decadic notation."--SciTechBookNews "Computability is concerned with the question of what computers can do in principle. Since Enderton directly contributed to the very areas that this book covers (computability and computational complexity), he is able to provide a concise and comprehensive firsthand view on the subject. As a scholar in the field, as well as in the history of logic, he frequently includes historical passages when presenting new concepts in the book. This is a beautifully written and beautifully printed book... The book fits perfectly as a textbook, covering standard material for one- or two-semester courses in computability or recursion theory. It is also an excellent study guide and reference for students and researchers in related areas. It is a lovely, short book that contains great ideas."--Computing Reviews

*"About this title" may belong to another edition of this title.*

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Quantity Available: 6

Seller

Rating

**Book Description **Book Condition: New. Bookseller Inventory # 23M000004RVF

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Quantity Available: 2

Seller

Rating

**Book Description **Book Condition: New. New Book. Bookseller Inventory # 0123849586SBK

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science Publishing Co Inc, United States
(2011)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Elsevier Science Publishing Co Inc, United States, 2011. Hardback. Book Condition: New. 229 x 152 mm. Language: English . Brand New Book. Computability Theory: An Introduction to Recursion Theory , provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory. Bookseller Inventory # AA59780123849588

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science Publishing Co Inc, United States
(2011)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Elsevier Science Publishing Co Inc, United States, 2011. Hardback. Book Condition: New. 229 x 152 mm. Language: English . Brand New Book. Computability Theory: An Introduction to Recursion Theory , provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory. Bookseller Inventory # AA59780123849588

More Information About This Seller | Ask Bookseller a Question

Published by
Academic Press
(2010)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Academic Press, 2010. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: "This textbook on basic computability theory is at the upper-undergraduate level."-- Zentralblatt MATH 2012-1243-03057 "Enderton (U. of California, Los Angeles) has written a clear, focused, and surprisingly literate textbook - it is a rare mathematician who is this adept with words - describing the history and theory of recursion theory that will be ideal for one-semester advanced courses in mathematics and computer science. After the concepts and theories are introduced, the equivalence of computable partial function and recursive partial function are demonstrated, in part through proofs of the unsolvability of the halting problem and of the enumeration theorem. Other chapters describe the properties of recursively enumerable sets, the link between computability theory and Gdel's incompleteness theorem, relative computability and degrees of unsolvability, and polynomial time computability. Appendices are included on Mathspeak, countability, and decadic notation."-- SciTechBookNews "Computability is concerned with the question of what computers can do in principle. Since Enderton directly contributed to the very areas that this book covers (computability and computational complexity), he is able to provide a concise and comprehensive firsthand view on the subject. As a scholar in the field, as well as in the history of logic, he frequently includes historical passages when presenting new concepts in the book. This is a beautifully written and beautifully printed book. The book fits perfectly as a textbook, covering standard material for one- or two-semester courses in computability or recursion theory. It is also an excellent study guide and reference for students and researchers in related areas. It is a lovely, short book that contains great ideas."-- Computing Reviews. Bookseller Inventory # ABE_book_new_0123849586

More Information About This Seller | Ask Bookseller a Question

Published by
Academic Pr
(2010)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 2

Seller

Rating

**Book Description **Academic Pr, 2010. Hardcover. Book Condition: Brand New. 1st edition. 192 pages. 9.50x6.50x0.50 inches. In Stock. Bookseller Inventory # __0123849586

More Information About This Seller | Ask Bookseller a Question

Published by
Academic Press
(2010)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Academic Press, 2010. Hardback. Book Condition: NEW. 9780123849588 192pp., Hardback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0892964

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Quantity Available: 2

Seller

Rating

**Book Description **Book Condition: New. Bookseller Inventory # 9947328-n

More Information About This Seller | Ask Bookseller a Question

Published by
Academic Press
(2010)

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Academic Press, 2010. Hardcover. Book Condition: New. 1. Bookseller Inventory # DADAX0123849586

More Information About This Seller | Ask Bookseller a Question

Published by
Elsevier Science Publishing Co Inc

ISBN 10: 0123849586
ISBN 13: 9780123849588

New
Hardcover
Quantity Available: 2

Seller

Rating

**Book Description **Elsevier Science Publishing Co Inc. Hardback. Book Condition: new. BRAND NEW, Computability Theory: An Introduction to Recursion Theory, Herbert B. Enderton, "Computability Theory: An Introduction to Recursion Theory", provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. "Computability Theory" is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way. Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory. Bookseller Inventory # B9780123849588

More Information About This Seller | Ask Bookseller a Question