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

by Hans Hermes

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.