Enumerability . Decidability Computability: An Introduction to the Theory of Recursive Functions by Hans Hermes
Enumerability . Decidability Computability: An Introduction to the Theory of Recursive Functions
—
Hans Hermes
Add cover

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

Grundlehren Der Mathematischen Wissenschaften (Springer Hardcover)

Hans Hermes with O. Plassmann (Translator), Gabor T. Herman (Translator)

250 pages • missing pub info (editions)

nonfiction mathematics challenging informative reflective medium-paced
Powered by AI (Beta)
Loading...

Description

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 ...

Read more

Community Reviews

Loading...

Content Warnings

Loading...