Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Computability, Enumerability, Unsolvability -

inglise keel
2009-04-18
102,69 € 146,70 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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, ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Kirjastaja Cambridge University Press
Väljalaskeaasta 2009
Kaanetüüp Pehme kaanega
EAN 9780521557368
Kirjuta oma arvustus
Te vaatate: Computability, Enumerability, Unsolvability
Teie hinnang:

Goodreads'i arvustused

102,69 € 146,70 €