• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithms for Constructing Computably Enumerable Sets

Algorithms for Constructing Computably Enumerable Sets

Hardcover

Series: Computer Science Foundations and Applied Logic

FictionGeneral Computers

ISBN10: 3031269039
ISBN13: 9783031269035
Publisher: Springer Nature
Published: May 24 2023
Pages: 183
Weight: 1.01
Height: 0.50 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Computers