| 书目名称 | Turing Computability |
| 副标题 | Theory and Applicati |
| 编辑 | Robert I. Soare |
| 视频video | |
| 概述 | Author is among the world‘s leading authorities on the topic of computability.Content has been thoroughly class-tested for many years by hundreds of lecturers and teachers in this field.Emphasizes the |
| 丛书名称 | Theory and Applications of Computability |
| 图书封面 |  |
| 描述 | .Turing‘s famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. .Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part IIincludes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use |
| 出版日期 | Textbook 2016 |
| 关键词 | Alan Turing; Computability theory; Computably enumerable (C; E; ) sets; Turing reducibility; Finite injury |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-31933-4 |
| isbn_softcover | 978-3-662-56858-3 |
| isbn_ebook | 978-3-642-31933-4Series ISSN 2190-619X Series E-ISSN 2190-6203 |
| issn_series | 2190-619X |
| copyright | Springer-Verlag Berlin Heidelberg 2016 |
发表于 2025-3-21 17:38:43
