Computability, complexity, and languages : fundamentals of theoretical computer science
Saved in:
| Main Authors: | , |
|---|---|
| Format: | eBook Book |
| Language: | English |
| Published: |
Orlando, Fla
Academic Press
1983
Elsevier Science & Technology |
| Edition: | 1 |
| Subjects: | |
| ISBN: | 9780122063800, 0122063805 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Author | Weyuker, Elaine J Davis, Martin |
|---|---|
| Author_xml | – sequence: 1 fullname: Davis, Martin – sequence: 2 fullname: Weyuker, Elaine J |
| BackLink | https://cir.nii.ac.jp/crid/1130000796654910336$$DView record in CiNii |
| BookMark | eNotkE1LAzEQhiNasdb-hz0IXizkc5J406V-QMGL6LFkk2yNbpO6mwX998bWy7zzwjPzDnOOTmKK_gjNtVSEK0aBCyWO9x4TSjEwhfEEnSmGMZVUnqKp0kpKoiU_Q_Nh-MC4gACAyRS91Wm7G7NpQhfyz3Vli-3897430VWdiZvRbPxQ3VTtGJ3Z-phNN1SprfK7T73PwZpuPzdm31eDDT5af4EmbcH8_F9n6PV--VI_LlbPD0_17WphgAFRC-aMlk4Z6zSlRLsGSKNsK5ihynKCmTdKMk-YkOA4MUozANW2glOtNcdshq4Oi3d9-hr9kNe-SenTljN7062XdzXRmAhBC3l5IGMIaxv-KiHlSRhLDSC4LmkM2C-jtGHN |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 511.3 |
| DatabaseName | CiNii Complete |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 9781483264585 1483264580 |
| Edition | 1 |
| ExternalDocumentID | EBC1901552 BA01483071 |
| GroupedDBID | 20A 38. AAAAS AABBV AALRI AAXUO ABARN ABGWT ABMAC ABMRC ABQPQ ABQQC ACLGV ADVEM AERYV AFOJC AGAMA AHWGJ AJFER ALMA_UNASSIGNED_HOLDINGS ANBBL AZZ BBABE CETPU CZZ EBSCA GEOUK HGY JJU MYL P1U RYH SRW |
| ID | FETCH-LOGICAL-a63618-3da97d8acd92219db61b8cf53a28c4103ea873e13576d41a893668ff542999403 |
| ISBN | 9780122063800 0122063805 |
| IngestDate | Wed Nov 26 04:40:53 EST 2025 Thu Jun 26 22:05:09 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 83002727 |
| LCCallNum_Ident | QA267.D38 1983eb |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a63618-3da97d8acd92219db61b8cf53a28c4103ea873e13576d41a893668ff542999403 |
| Notes | Bibliography: p. 417-418 Includes index |
| OCLC | 898771974 |
| PQID | EBC1901552 |
| PageCount | 448 |
| ParticipantIDs | proquest_ebookcentral_EBC1901552 nii_cinii_1130000796654910336 |
| PublicationCentury | 1900 |
| PublicationDate | 1983 |
| PublicationDateYYYYMMDD | 1983-01-01 |
| PublicationDate_xml | – year: 1983 text: 1983 |
| PublicationDecade | 1980 |
| PublicationPlace | Orlando, Fla |
| PublicationPlace_xml | – name: Orlando, Fla – name: Chantilly |
| PublicationYear | 1983 |
| Publisher | Academic Press Elsevier Science & Technology |
| Publisher_xml | – name: Academic Press – name: Elsevier Science & Technology |
| SSID | ssj0001266601 |
| Score | 1.8752065 |
| SourceID | proquest nii |
| SourceType | Publisher |
| SubjectTerms | Computational complexity Formal languages Machine theory |
| TableOfContents | CHAPTER 16. Classifying Unsolvable Problems -- 1. Using Oracles -- 2. Relativization of Universality -- 3. Reducibility -- 4. Sets R.E. Relative to an Oracle -- 5. The Arithmetic Hierarchy -- 6. Post's Theorem -- 7. Classifying Some Unsolvable Problems -- 8. Rice's Theorem Revisited -- 9. Recursive Permutations -- CHAPTER 17. Degrees of Unsolvability and Post's Problem -- 1. Turing Degrees -- 2. The Kleene-Post Theorem -- 3. Creative Sets-Myhill's Theorem -- 4. Simple Sets-Dekker's Theorem -- 5. Sacks's Splitting Theorem -- 6. The Priority Method -- Suggestions for Further Reading -- Index -- Computer Science and Applied Mathematics: A SERIES OF MONOGRAPHS AND TEXTBOOKS Front Cover -- Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science -- Copyright Page -- Table of Contents -- Dedication -- Preface -- Acknowledgments -- Dependency Graph -- CHAPTER 1. Preliminaries -- 1. Sets and n-tuples -- 2. Functions -- 3. Alphabets and Strings -- 4. Predicates -- 5. Quantifiers -- 6. Proof by Contradiction -- 7. Mathematical Induction -- PART 1: COMPUTABILITY -- CHAPTER 2. Programs and Computable Functions -- 1. A Programming Language -- 2. Some Examples of Programs -- 3. Syntax -- 4. Computable Functions -- 5. More about Macros -- CHAPTER 3. Primitive Recursive Functions -- 1. Composition -- 2. Recursion -- 3. PRC Classes -- 4. Some Primitive Recursive Functions -- 5. Primitive Recursive Predicates -- 6. Iterated Operations and Bounded Quantifiers -- 7. Minimalization -- 8. Pairing Functions and Gödel Numbers -- CHAPTER 4. A Universal Program -- 1. Coding Programs by Numbers -- 2. The Halting Problem -- 3. Universality -- 4. Recursively Enumerable Sets -- 5. The Parameter Theorem -- 6. The Recursion Theorem -- 7. Rice's Theorem -- CHAPTER 5. Calculations on Strings -- 1. Numerical Representation of Strings -- 2. A Programming Language for String Computations -- 3. The Languages ¥ and £f n -- 4. Post-Turing Programs -- CHAPTER 6. Turing Machines -- 1. Internal States -- 2. A Universal Turing Machine -- 3. The Languages Accepted by Turing Machines -- 4. The Halting Problem for Turing Machines -- 5. Nondeterministic Turing Machines -- 6. Variations on the Turing Machine Theme -- CHAPTER 7. Processes and Grammars -- 1. Semi-Thue Processes -- 2. Simulation of Nondeterministic Turing Machines by Semi-Thue Processes -- 3. Unsolvable Word Problems -- 4. Post's Correspondence Problem -- 5. Grammars -- 6. Some Unsolvable Problems Concerning Grammars -- 7. Recursion and Minimalization 8. Normal Processes -- 9. A Non-R.E. Set -- PART 2: GRAMMARS AND AUTOMATA -- CHAPTER 8. Regular Languages -- 1. Finite Automata -- 2. Nondeterministic Finite Automata -- 3. Additional Examples -- 4. Closure Properties -- 5. Kleene's Theorem -- 6. The Pumping Lemma and Its Applications -- 7. The Myhill-Nerode Theorem -- CHAPTER 9. Context-Free Languages -- 1. Context-Free Grammars and Their Derivation Trees -- 2. Regular Grammars -- 3. Chomsky Normal Form -- 4. Bar-Hillel's Pumping Lemma -- 5. Closure Properties -- 6. Solvable and Unsolvable Problems -- 7. Bracket Languages -- 8. Pushdown Automata -- 9. Compilers and Formal Languages -- CHAPTER 10. Context-Sensitive Languages -- 1. The Chomsky Hierarchy -- 2. Linear Bounded Automata -- 3. Closure Properties -- PART 3: LOGIC -- CHAPTER 11. Propositional Calculus -- 1. Formulas and Assignments -- 2. Tautological Inference -- 3. Normal Forms -- 4. The Davis-Putnam Rules -- 5. Minimal Unsatisfiability and Subsumption -- 6. Resolution -- 7. The Compactness Theorem -- CHAPTER 12. Quantification Theory -- 1. The Language of Predicate Logic -- 2. Semantics -- 3. Logical Consequence -- 4. Herbrand's Theorem -- 5. Unification -- 6. Compactness and Countability -- 7. Gödel's Incompleteness Theorem -- 8. Unsolvability of the Satisfiability Problem in Predicate Logic -- PART 4: COMPLEXITY -- CHAPTER 13. Loop Programs -- 1. The Language L and Primitive Recursive Functions -- 2. Running Time -- 3. S£n as a Hierarchy -- 4. A Converse to the Bounding Theorem -- 5. Doing without Branch Instructions -- CHAPTER 14. Abstract Complexity -- 1. The Blum Axioms -- 2. The Gap Theorem -- 3. Preliminary Form of the Speedup Theorem -- 4. The Speedup Theorem Concluded -- CHAPTER 15. Polynomial-Time Computability -- 1. Rates of Growth -- 2. P versus NP -- 3. Cook's Theorem -- 4. Other NP-Complete Problems -- PART 5: UNSOLVABILITY |
| Title | Computability, complexity, and languages : fundamentals of theoretical computer science |
| URI | https://cir.nii.ac.jp/crid/1130000796654910336 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=1901552 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELagMMDEUxQo8sBGI8Wxk9hstCogHoWhlG6VEydSJJSipkXl33N23aSUATGwWImHG76zfA_ffYfQOQsjIiVTDphz6jDKpCM9HjiE-TGLfBq6ptq9_xB2u3wwEM-Ww7Uw4wTCPOezmXj_V1XDHihbt87-Qd2lUNiAb1A6rKB2WFc84vLXEg2YAQ1z3m0DnSkXT2b2T2fIF9nJwmQCUt0FMif3L2ytQNnUGNtpDxfWRFYZbctKMOcfqB52Pqe2PqPzJrXnelflE4jgdCWfUJXlL5WAzKNN_QqnPRzXrYxHWdLXutK5SbgxIBRdhximhjZuOk8v90sJL4iUXGJojawc3zIglXLBwOdZ9sMsGlvf20E13f-xi9aSfA9tP5a0tsU-ev0GcRNXADcxwItLePElXgYXj1K8BC5egIstuAeof93ptW8dO5nCkQENCHeokiJUXMZKeHDnqyggEY9Tn8JBjxlxaSJ5SBNCIZxTjEjwCoOAp6meDiYEc-khquWjPDlCOE1TqnyWSAjuWMQCESkGAiPPUyTywriOGoDJMM70SvTrI7h1Qg-NBk-P0qCO8AKtoXlgt1W9w06rbbw93zv-RcQJ2qpOwimqTcbTpIE2449JVozPrCK_AKaUKiU |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Computability%2C+complexity%2C+and+languages+%3A+fundamentals+of+theoretical+computer+science&rft.au=Davis%2C+Martin&rft.au=Weyuker%2C+Elaine+J&rft.date=1983-01-01&rft.pub=Academic+Press&rft.isbn=9780122063800&rft.externalDocID=BA01483071 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780122063800/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780122063800/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780122063800/sc.gif&client=summon&freeimage=true |