Algorithms for Constructing Computably Enumerable Sets

Name: Algorithms for Constructing Computably Enumerable Sets
Brand: Springer Nature
SKU: 9783031269035
Availability: InStock

Algorithms for Constructing Computably Enumerable Sets

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783031269035

Condition

New

0 Reviews

0 Questions | 0 Answers

Product Description

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.

Available Colors

N/A

Available Sizes

N/A

1 Offer Price Range: $49.99 - $49.99

BEST PRICE

Single Product Purchase

$45.00

@ Link.springer.com with extra coupon Get Coupon & BUY

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com Rate Seller This functionality is for registered users only. Go to Login/Register		$49.99	$49.99		10% OFF This deals requires coupon Get Code Here your10off @ Link.springer.com Deals Ends 31/08/2025	$45.00		See Site	In stock	Visit Store