Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Computability, Enumerability, Unsolvability -

angļu valoda
2009-04-18
102,69 € 146,70 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas 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, ... Pilns apraksts

Jums varētu patikt arī

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.

Vairāk informācijas

Izdevējs Cambridge University Press
Izlaides gads 2009
Vāka tips Mīkstais vāks
EAN 9780521557368
Rakstiet savu atsauksmi
Jūs vērtējat: Computability, Enumerability, Unsolvability
Jūsu novērtējums:

Goodreads atsauksmes

102,69 € 146,70 €