Free shipping on orders over $99
Algorithms for Constructing Computably Enumerable Sets

Algorithms for Constructing Computably Enumerable Sets

by Kenneth J. Supowit
Hardback
Publication Date: 06/06/2023

Share This Book:

  $126.60
or 4 easy payments of $31.65 with
afterpay
This item qualifies your order for FREE DELIVERY
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.
ISBN:
9783031269035
9783031269035
Category:
Mathematical theory of computation
Format:
Hardback
Publication Date:
06-06-2023
Publisher:
Birkhauser Verlag AG
Country of origin:
Switzerland
Pages:
183
Dimensions (mm):
235x155mm
Weight:
0.47kg

This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro: 2 working days
NSW Metro: 2 working days
NSW Rural: 2-3 working days
NSW Remote: 2-5 working days
NT Metro: 3-6 working days
NT Remote: 4-10 working days
QLD Metro: 2-4 working days
QLD Rural: 2-5 working days
QLD Remote: 2-7 working days
SA Metro: 2-5 working days
SA Rural: 3-6 working days
SA Remote: 3-7 working days
TAS Metro: 3-6 working days
TAS Rural: 3-6 working days
VIC Metro: 2-3 working days
VIC Rural: 2-4 working days
VIC Remote: 2-5 working days
WA Metro: 3-6 working days
WA Rural: 4-8 working days
WA Remote: 4-12 working days

Reviews

Be the first to review Algorithms for Constructing Computably Enumerable Sets.