Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Computability, Enumerability, Unsolvability
Directions in Recursion Theory
Engleski
181 b
Do 30 dana za povrat
Kupci su kupili i
/
Tvrdi uvez
15.39
€
/
Meki uvez
53.20
€
/
Meki uvez
16.21
€
/
Meki uvez
113.70
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
10.63
€
/
Meki uvez
24.11
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?