Order Total (1 Item Items):
Shipping Destination:
Computability Theory Introduction Recursion by Enderton Herbert (7 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (7)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (5)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (1)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (7)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (1)
- Not Print on Demand (5)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
hardcover. Condition: Acceptable.
-
Computability Theory: An Introduction to Recursion Theory
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Computability Theory: An Introduction to Recursion Theory
Language: English
Published by Academic Press 2010-12-30, 2010
ISBN 10: 0123849586 ISBN 13: 9780123849588
£ 53.20
£ 15.49 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardcover. Condition: New.
-
Hardcover. Condition: Brand New. 1st edition. 192 pages. 9.50x6.50x0.50 inches. In Stock.
-
Computability Theory: An Introduction to Recursion Theory
Language: English
Published by Elsevier Science Publishing Co Inc, 2010
ISBN 10: 0123849586 ISBN 13: 9780123849588
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 66.36
£ 15.45 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. New copy - Usually dispatched within 4 working days.
-
Condition: new. Questo è un articolo print on demand.
-
Buch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.; This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience and is designed to be accessible to junior and senior students without a previous background in the subject. The book will prepare the students for further study in computational complexity, logic, and theoretical computer science, as well as other topics. It focuses on computability theory, and excludes computer-science topics such as automata theory and context-free languages.
