 |
|
|
Item Details
| Title:
|
COMPUTABILITY THEORY
|
| By: |
S. Barry Cooper |
| Format: |
Hardback |
| List price:
|
£96.99 |
| Our price: |
£87.29 |
| Discount: |
|
| You save:
|
£9.70 |
|
|
|
|
|
| ISBN 10: |
1584882379 |
| ISBN 13: |
9781584882374 |
| Availability: |
Usually dispatched within 3-5 days.
 Delivery
rates
|
| Stock: |
Currently 1item in stock |
| Publisher: |
TAYLOR & FRANCIS INC |
| Pub. date: |
17 November, 2003 |
| Series: |
Chapman Hall/CRC Mathematics Series |
| Pages: |
420 |
| Description: |
Offers an introduction to contemporary computability theory, techniques, and results. This book places the basic concepts and techniques of computability theory in their historical, philosophical and logical context. It includes a chapter that explores a variety of computability applications to mathematics and science. |
| Synopsis: |
Computability theory originated with the seminal work of Godel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability 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 book 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 and lively way. |
| Illustrations: |
35 black & white illustrations |
| Publication: |
US |
| Imprint: |
Chapman & Hall/CRC |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|