MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03061nam a2200349Ia 4500 |
| 000 - LEADER |
|---|
| fixed length control field |
04071nam a22003855i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
978-3-031-26904-2 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20240319120829.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230523s2023 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783031269042 |
| -- |
978-3-031-26904-2 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
4.0151 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Supowit, Kenneth J. |
| 9 (RLIN) |
29965 |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Algorithms for Constructing Computably Enumerable Sets |
| Statement of responsibility, etc. |
by Kenneth J. Supowit. |
| Medium |
[electronic resource] / |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
1st ed. 2023. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Cham |
| Name of publisher, distributor, etc. |
Springer International Publishing |
| Date of publication, distribution, etc. |
2023 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XIV, 183 p. 46 illus., 4 illus. in color. |
| Other physical details |
online resource. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computability and Recursion Theory. |
| 9 (RLIN) |
29966 |
|
|---|
| Topical term or geographic name entry element |
Computable functions. |
| 9 (RLIN) |
29967 |
|
|---|
| Topical term or geographic name entry element |
Computer science |
| 9 (RLIN) |
29968 |
|
|---|
| Topical term or geographic name entry element |
Computer science. |
| 9 (RLIN) |
29968 |
|
|---|
| Topical term or geographic name entry element |
Mathematics of Computing. |
| 9 (RLIN) |
29969 |
|
|---|
| Topical term or geographic name entry element |
Recursion theory. |
| 9 (RLIN) |
29970 |
|
|---|
| Topical term or geographic name entry element |
Set theory. |
| 9 (RLIN) |
29971 |
|
|---|
| Topical term or geographic name entry element |
Set Theory. |
| 9 (RLIN) |
29972 |
|
|---|
| Topical term or geographic name entry element |
Theory and Algorithms for Application Domains. |
| 9 (RLIN) |
29973 |
|
|---|
| Topical term or geographic name entry element |
Theory of Computation. |
| 9 (RLIN) |
29974 |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://doi.org/10.1007/978-3-031-26904-2">https://doi.org/10.1007/978-3-031-26904-2</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
e-Book |
| Source of classification or shelving scheme |
Dewey Decimal Classification |
