Mendeley出力
Algorithms for Constructing Computably Enumerable Sets / by Kenneth J. Supowit
(Computer Science Foundations and Applied Logic. ISSN:27315762)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2023. |
| 出版者 | (Cham : Springer International Publishing : Imprint: Birkhäuser) |
| 出版年 | 2023 |
| 大きさ | XIV, 183 p. 46 illus., 4 illus. in color : online resource |
| 著者標目 | *Supowit, Kenneth J author SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | 1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What’s new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal. Topics and features: · All other books in this field focus on the mathematical results, rather than on the algorithms. · There are many exercises here, most of which relate to details of the algorithms. · The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. · The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. · In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas. Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it. Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US HTTP:URL=https://doi.org/10.1007/978-3-031-26904-2 |
|---|---|
| 件 名 | LCSH:Computer science LCSH:Computable functions LCSH:Recursion theory LCSH:Set theory LCSH:Computer science -- Mathematics 全ての件名で検索 FREE:Theory of Computation FREE:Computability and Recursion Theory FREE:Set Theory FREE:Theory and Algorithms for Application Domains FREE:Mathematics of Computing |
| 分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
| 書誌ID | EB00001509 |
| ISBN | 9783031269042 |
類似資料
この資料の利用統計
このページへのアクセス回数：7回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降