rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computability theory
    sub title: an introduction to recursion theory
  name:
    name part: Enderton, Herbert B.
    role:
      role term: creator
    role:
      role term: author
  type of resource: text
  origin info:
    place:
      place term: ne
    place:
      place term: Amsterdam, Netherland
    place:
      place term: Boston
    publisher: Academic Press
    date issued: c2011
    date issued: 2011
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: viii, 174 p. : ill. ; 24 cm.
  abstract: 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
  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
  note: Herbert B. Enderton
  note: Includes bibliographical references (p. 163-164) and index
  subject:
    topic: Recursion theory
  classification: QA9.6 .E53 2011
  identifier: 0123849586 (hardback : alk. paper)
  identifier: 9780123849588 (hardback : alk. paper)
  record info:
    record creation date: 120701
    record change date: 20130326093000.0
    record identifier: 0000079133