Enumerability, decidability computability; an introduction to the theory of recursive functions. 2nd. rev ed.

Hermes, Hans.\

Enumerability, decidability computability; an introduction to the theory of recursive functions. 2nd. rev ed. - - SPRINGER-VERLAG, BERLIN, 1969 - p.x,245, 23cm., - .

8



Mathematics


51:681.3Her

Powered by Koha