computability theory introduction recursion von enderton herbert (6 Ergebnisse)

Zustand: 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.

Hardcover. Zustand: New.

Hardcover. Zustand: Brand New. 1st edition. 192 pages. 9.50x6.50x0.50 inches. In Stock.

Hardback. Zustand: New. New copy - Usually dispatched within 4 working days.

Zustand: new. Questo è un articolo print on demand.

Buch. Zustand: 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.