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
  name:
    name part: Cooper, S. B. (S. Barry)
    role:
      role term: creator
  name:
    name part: Taylor & Francis
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: flu
    date issued: 2004
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (ix, 409 pages) : illustrations
  abstract: "Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth of coverage, including a number of advanced topics not usually addressed in books at this level. The result is an invaluable text, reference, and guide to the direction of current research in the field. The author brings the techniques and results of this beautiful and basic subject alive in an approachable and lively way."--Jacket
  table of contents: pt. I. Computability and Unsolvable Problems -- 1. Hilbert and the Origins of Computability Theory -- 2. Models of Computability and the Church-Turing Thesis -- 3. Language, Proof and Computable Functions -- 4. Coding, Self-Reference and the Universal Turning Machine -- 5. Enumerability and Computability -- 6. The Search for Natural Examples of Incomputable Sets -- 7. Comparing Computability and the Ubiquity of Creative Sets -- 8. Godel's Incompleteness Theorem -- 9. Decidable and Undecidable Theories -- pt. II. Incomputability and Information Content -- 10. Computing with Oracles -- 11. Nondeterminism, Enumerations and Polynomial Bounds -- pt. III. More Advanced Topics -- 12. Post's Problem: Immunity and Priority.
  note: S. Barry Cooper.
  note: Includes bibliographical references (pages 383-388) and index.
  subject:
    topic: Computable functions
  subject:
    topic: Fonctions calculables
  subject:
    topic: MATHEMATICS
    topic: General
  subject:
    topic: Computable functions
  subject:
    topic: Berechenbarkeit
  subject:
    topic: Mathematische Logik
  subject:
    topic: Recursie
  subject:
    topic: Complexiteit
  classification: QA9.59 .C68 2004eb
  classification: 511.3
  classification: 31.10
  related item:
    title info:
      title: Computability theory
    name:
      name part: Cooper, S.B. (S. Barry).
    origin info:
      publisher: Boca Raton : Chapman & Hall/CRC, ©2004
    identifier: (DLC) 2003055823
    identifier: (OCoLC)52860108
  related item:
    title info:
      title: Chapman & Hall/CRC mathematics
  identifier: 9781315275789
  identifier: 1315275783
  identifier: 9781420057560
  identifier: 1420057561
  identifier: 1584882379
  identifier: 9781584882374
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: N$T
    record creation date: 170911
    record change date: 20241111204720.0
    record identifier: in00005527716
    language of cataloging:
      language term: eng