|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Nigel CutlandPublisher: Cambridge University Press Imprint: Cambridge University Press (Virtual Publishing) ISBN: 9781139171496ISBN 10: 1139171496 Publication Date: 28 May 2018 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Professional & Vocational Format: Undefined Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsPreface; Prologue, prerequisites and notation; 1. Computable functions; 2. Generating computable functions; 3. Other approaches to computability: Church's thesis; 4. Numbering computable functions; 5. Universal programs; 6. Decidability, undecidability and partical decidability; 7. Recursive and recursively enumerable sets; 8. Arithmetic and Gödel's incompleteness theorem; 9. Reducibility and degrees; 10. Effective operations on partial functions; 11. The second recursion theorem; 12. Complexity of computation; 13. Further study.ReviewsDr. Cutland has produced here an excellent and much needed textbook which will undoubtedly help to establish recursion theory as a more widely taught branch of mainstream mathematics. Mathematics & Physics Author InformationTab Content 6Author Website:Countries AvailableAll regions |