Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Computability, Enumerability, Unsolvability -

Anglų
2009-04-18
110,02 € 146,70 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 15-21 d.d.

30 dienų grąžinimo politika

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, ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Leidėjas Cambridge University Press
Išleidimo metai 2009
Viršelio tipas Minkšti viršeliai
EAN 9780521557368
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Computability, Enumerability, Unsolvability
Jūsų įvertinimas:

Goodreads Atsiliepimai

110,02 € 146,70 €