000			03061nam a2200349Ia 4500
000			04071nam a22003855i 4500
001			978-3-031-26904-2
003			DE-He213
005			20240319120829.0
007			cr nn 008mamaa
008			230523s2023 sz | s |||| 0|eng d
020			_a9783031269042 _9978-3-031-26904-2
082			_a4.0151
100			_aSupowit, Kenneth J. _929965
245			_aAlgorithms for Constructing Computably Enumerable Sets _cby Kenneth J. Supowit. _h[electronic resource] /
250			_a1st ed. 2023.
260			_aCham _bSpringer International Publishing _c2023
300			_aXIV, 183 p. 46 illus., 4 illus. in color. _bonline resource.
520			_aLogicians 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.
650			_aComputability and Recursion Theory. _929966
650			_aComputable functions. _929967
650			_aComputer science _929968
650			_aComputer science. _929968
650			_aMathematics of Computing. _929969
650			_aRecursion theory. _929970
650			_aSet theory. _929971
650			_aSet Theory. _929972
650			_aTheory and Algorithms for Application Domains. _929973
650			_aTheory of Computation. _929974
856			_uhttps://doi.org/10.1007/978-3-031-26904-2
942			_cEBK _2ddc
999			_c15092 _d15092