Browse editions

Current edition
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

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

Grundlehren Der Mathematischen Wissenschaften (Springer Hardcover)

Hans Hermes

250 pages • missing pub info (editions)

nonfiction mathematics challenging informative reflective medium-paced
Other editions (1)
Expand filter menu Filter editions
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

Grundlehren Der Mathematischen Wissenschaften (Springer Hardcover)

Hans Hermes

250 pages • missing pub info (editions)

nonfiction mathematics challenging informative reflective medium-paced