An edition of Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit (1961)

Enumerability, decidability, computability

an introduction to the theory of recursive functions

By Hans Hermes

0 (0 Ratings)

1 Want to read0 Currently reading0 Have read

Publish Date

1965

Publisher

Springer-Verlag

Language

eng

Pages

246

Description:

subjects: Algorithms, Computable functions, Gödel's theorem, Recursive functions, Berechenbarkeit, Fonctions récursives, Mathématiques, Rekursive Funktion, Entscheidbarkeit, Algorithmentheorie, Aufzählbarkeit, Logique