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 algo- rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability...

• Format: Paperback
• Language: English
• ISBN: 3642461808
• ISBN13: 9783642461804
• Release Date: February 2012
• Publisher: Springer
• Length: 250 Pages
• Weight: 0.83 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"