LEADER 00000cam a2200709 a 4500 
001    706803074 
003    OCoLC 
005    20240129213017.0 
006    m     o  d         
007    cr cn||||||||| 
008    110311s2011    ne a    ob    001 0 eng d 
010      2010038448 
015    GBB0B0040|2bnb 
016 7  015648792|2Uk 
019    698912923|a769384748|a775117196|a801812121|a963365612
       |a1028650869|a1028885100|a1028947421|a1058109506
       |a1062873762|a1078938691|a1153051817 
020    9780123849588|q(electronic bk.) 
020    0123849586|q(electronic bk.) 
020    9780123849595 
020    0123849594 
024 8  9786612955150 
024 8  99941236049 
029 1  AU@|b000047499857 
029 1  AU@|b000050013233 
029 1  CHNEW|b001010047 
029 1  DEBBG|bBV039830057 
029 1  DEBBG|bBV040900687 
029 1  DEBSZ|b337164525 
029 1  DEBSZ|b378275925 
029 1  DEBSZ|b381367142 
029 1  NZ1|b15190049 
029 1  DKDLA|b820120-katalog:9910110510305765 
035    (OCoLC)706803074|z(OCoLC)698912923|z(OCoLC)769384748
       |z(OCoLC)775117196|z(OCoLC)801812121|z(OCoLC)963365612
       |z(OCoLC)1028650869|z(OCoLC)1028885100|z(OCoLC)1028947421
       |z(OCoLC)1058109506|z(OCoLC)1062873762|z(OCoLC)1078938691
       |z(OCoLC)1153051817 
037    1099043:10931991|bElsevier Science & Technology|nhttp://
       www.sciencedirect.com 
040    OPELS|beng|epn|cOPELS|dOCLCQ|dCDX|dDEBSZ|dOCLCQ|dDKDLA
       |dUMI|dCOO|dOCLCQ|dYDXCP|dOCLCQ|dOCLCF|dOCLCQ|dYDX|dOCLCQ
       |dU3W|dD6H|dCEF|dWYU|dUCW|dAU@|dLEAUB|dOL$|dOCLCQ|dOCLCO
       |dVT2|dOCLCO|dOCLCQ|dOCLCO 
049    INap 
082 04 511.3/5 
082 04 511.3/5|222 
099    eBook O’Reilly for Public Libraries 
100 1  Enderton, Herbert B. 
245 10 Computability theory :|ban introduction to recursion 
       theory /|cHerbert B. Enderton.|h[O'Reilly electronic 
       resource] 
260    Amsterdam ;|aBoston :|bAcademic Press,|c©2011. 
300    1 online resource (viii, 174 pages) :|billustrations 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
504    Includes bibliographical references and index. 
505 0  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. 
505 0  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. 
520    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. 
588 0  Print version record. 
590    O'Reilly|bO'Reilly Online Learning: Academic/Public 
       Library Edition 
650  0 Recursion theory. 
650  6 Théorie de la récursivité. 
650  7 Recursion theory|2fast 
650  7 Berechenbarkeit.|2idsbb 
650  7 Rekursionsmethode.|2idsbb 
650  7 Berechenbarkeit.|2idszbz 
650  7 Rekursionstheorie.|2idszbz 
776 08 |iPrint version:|aEnderton, Herbert B.|tComputability 
       theory.|dAmsterdam ; Boston : Academic Press, ©2011
       |z9780123849588|w(DLC)  2010038448|w(OCoLC)641524716 
856 40 |uhttps://ezproxy.naperville-lib.org/login?url=https://
       learning.oreilly.com/library/view/~/9780123849588/?ar
       |zAvailable on O'Reilly for Public Libraries 
938    Coutts Information Services|bCOUT|n17202176 
938    YBP Library Services|bYANK|n7249007 
994    92|bJFN