Algorithms for Constructing Computably Enumerable Sets

By (author)Supowit

10-12 Days Shipping (Supply on Demand)

  • Delivery

    ₹75 shipping all over India

  • Secure Payment

    100% Secure Payment

4,263.005,657.00

Only 1 left in stock

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.

SKU: 9783031269035
Category:
Tag:
Weight 1 kg
Book Author

Supowit

Edition

1st

Format

Hardback

ISBN

9783031269035

Language

English

Pages

200

Publication Year

Publisher

Sell by

sarasbooksonline.com

Customer Reviews

There are no reviews yet.

Be the first to review “Algorithms for Constructing Computably Enumerable Sets”

Your email address will not be published. Required fields are marked *