Computability Theory: An Introduction to Recursion Theory, Students Solutions Manual (e-only)

By 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.

• Language: English
• Publisher: Academic Press
• Release date: May 26, 2011
• ISBN: 9780123878366

Book preview

Table of Contents

Cover image

Front Matter

Copyright

1. The Computability Concept

2. General Recursive Functions

3. Programs and Machines

4. Recursive Enumerability

5. Connections to Logic

6. Degrees of Unsolvability

7. Polynomial-Time Computability

Front Matter

Computability Theory

An Introduction to Recursion Theory

Students Solutions Manual

Herbert B. Enderton

B9780123878366000121/elsevier_logo.jpg is missing AMSTERDAM • BOSTON • HEIDELBERG • LONDON • NEW YORK • OXFORD • PARIS • SAN DIEGO • SAN FRANCISCO • SINGAPORE • SYDNEY • TOKYO B9780123878366000121/academicpress_logo.jpg is missing

Academic Press is an imprint of Elsevier

Copyright

Academic Press is an imprint of Elsevier

225 Wyman Street, Waltham, MA 02451, USA

The Boulevard, Langford Lane, Kidlington, Oxford, OX5 1GB, UK

© 2011 Elsevier Inc. All rights reserved.

No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or any information storage and retrieval system, without permission in writing from the publisher. Details on how to seek permission, further information about the Publisher's permissions policies and our arrangements with organizations such as the Copyright Clearance Center and the Copyright Licensing Agency, can be found at our website: