| 书目名称 | The Foundations of Computability Theory | | 编辑 | Borut Robič | | 视频video | | | 概述 | Original, informative view of the development of the fundamental concepts of computability theory.Avoids excessive formalism, offering instead intuitive understanding.Characterized by appreciation of | | 图书封面 |  | | 描述 | .This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits thecomputability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and | | 出版日期 | Textbook 2020Latest edition | | 关键词 | Algorithms; Computability Theory; Relative Computability; Turing Machine; Oracles; Models of Computation; | | 版次 | 2 | | doi | https://doi.org/10.1007/978-3-662-62421-0 | | isbn_softcover | 978-3-662-62423-4 | | isbn_ebook | 978-3-662-62421-0 | | copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
The information of publication is updating
|
|
发表于 2025-3-21 19:51:04
