No Words Wasted Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    The Powell's Playlist | January 15, 2015

    Mary Helen Specht: IMG The Powell's Playlist: Mary Helen Specht



    Migratory Animals is mostly set in Texas during the first years of the most recent recession, when the cast of characters — an eclectic group... Continue »
    1. $10.49 Sale Trade Paper add to wish list

      Migratory Animals (P.S.)

      Mary Helen Specht 9780062346032

    spacer
Qualifying orders ship free.
$39.00
List price: $93.50
Used Hardcover
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Hawthorne Textbooks- General

More copies of this ISBN

Computability Theory: An Introduction to Recursion Theory

by

Computability Theory: An Introduction to Recursion Theory Cover

 

Synopses & Reviews

Publisher Comments:

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.

Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory  

Book News Annotation:

Enderton (U. of California, Los Angeles) has written a clear, focused, and surprisingly literate textbook--it is a rare mathematician who is this adept with words--describing the history and theory of recursion theory that will be ideal for one-semester advanced courses in mathematics and computer science. After the concepts and theories are introduced, the equivalence of computable partial function and recursive partial function are demonstrated, in part through proofs of the unsolvability of the halting problem and of the enumeration theorem. Other chapters describe the properties of recursively enumerable sets, the link between computability theory and Gdel's incompleteness theorem, relative computability and degrees of unsolvability, and polynomial time computability. Appendices are included on Mathspeak, countability, and decadic notation. Annotation ©2011 Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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

Undergraduates can read and understand the material

Pointers to more advanced topics, and provides a base for further study of such topics

Covers a strong introductory set of material from a modern mathematical viewpoint

Table of Contents

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; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation;

Product Details

ISBN:
9780123849588
Author:
Enderton, Herbert
Publisher:
Academic Press
Author:
Enderton, Herbert B.
Subject:
General
Subject:
General Mathematics
Subject:
Information Theory
Subject:
Mathematics-Logic and Philosophy
Copyright:
Publication Date:
20101231
Binding:
HARDCOVER
Language:
English
Pages:
192
Dimensions:
9.21 x 6.125 in

Related Subjects

Engineering » Communications » Information Theory
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » Logic and Philosophy
Science and Mathematics » Physics » General
Textbooks » General

Computability Theory: An Introduction to Recursion Theory Used Hardcover
0 stars - 0 reviews
$39.00 In Stock
Product details 192 pages Academic Press - English 9780123849588 Reviews:
"Synopsis" by , 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, 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.

Undergraduates can read and understand the material

Pointers to more advanced topics, and provides a base for further study of such topics

Covers a strong introductory set of material from a modern mathematical viewpoint

spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.