Fri frakt over 399 kr
Fri frakt over 399 kr
Kundeservice
Computability, Enumerability, Unsolvability
-1 %

Computability, Enumerability, Unsolvability

709 kr

709 kr

Tidligere laveste pris:

713 kr

På lager

On., 25 juni - ti., 1 juli


Sikker betaling

14 dagers åpent kjøp


Selges og leveres av

Adlibris

Produktbeskrivelse

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource for specialists and non-specialists alike.

Artikkel nr.

ab300f2a-1ba2-4d83-b59a-3d2ff099405f

Computability, Enumerability, Unsolvability

709 kr

709 kr

Tidligere laveste pris:

713 kr

På lager

On., 25 juni - ti., 1 juli


Sikker betaling

14 dagers åpent kjøp


Selges og leveres av

Adlibris