Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Years
Person/Organisation
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    Amsterdam : Academic Press
    UID:
    b3kat_BV039830057
    Format: 1 Online-Ressource (1 online resource (viii, 174 p.))
    ISBN: 9780123849588 , 0123849586
    Note: 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 , 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 , Includes bibliographical references and index , The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Rekursionstheorie ; Electronic books ; Electronic books ; Electronic books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Amsterdam [u.a.] :Elsevier, Acad. Press,
    UID:
    almahu_BV036896629
    Format: VIII, 174 S.
    ISBN: 978-0-12-384958-8
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Rekursionstheorie
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Burlington, MA :Elsevier Inc.,
    UID:
    almahu_9948025691102882
    Format: 1 online resource (192 p.)
    Edition: 1st edition
    ISBN: 1-282-95515-2 , 9786612955150 , 0-12-384959-4
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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; , English
    Additional Edition: ISBN 0-12-384958-6
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Burlington, MA :Elsevier Inc.,
    UID:
    edocfu_9960073636302883
    Format: 1 online resource (192 p.)
    Edition: 1st edition
    ISBN: 1-282-95515-2 , 9786612955150 , 0-12-384959-4
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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; , English
    Additional Edition: ISBN 0-12-384958-6
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Burlington, MA :Elsevier Inc.,
    UID:
    edoccha_9960073636302883
    Format: 1 online resource (192 p.)
    Edition: 1st edition
    ISBN: 1-282-95515-2 , 9786612955150 , 0-12-384959-4
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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; , English
    Additional Edition: ISBN 0-12-384958-6
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 0123846587?
Did you mean 0123849136?
Did you mean 012384956x?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages