Enumerability . Decidability Computability: An Introduction to the Theory of Recursive Functions

No Customer Reviews

Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by... This description may be from another edition of this product.

Format:Hardcover

Language:English

ISBN:3540045015

ISBN13:9783540045014

Release Date:January 1969

Publisher:Springer

Length:250 Pages

Weight:1.40 lbs.

Related Subjects

Math Mathematics Science & Math

Customer Reviews

0 rating

Write a review

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Copyright © 2025 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ^® and the ThriftBooks ^® logo are registered trademarks of Thrift Books Global, LLC

Enumerability . Decidability Computability: An Introduction to the Theory of Recursive Functions

Recommended

Customer Reviews

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

Follow Us