Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Engleski
138 b
Do 30 dana za povrat
Kupci su kupili i
/
Meki uvez
12.37
€
/
Meki uvez
12.57
€
This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question? How can we show that none is possible? How computationally hard is the question we are concerned with? Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps? Can we perform some algorithm with only a limited memory? Does randomness help? Are there standard approaches to overcoming computational difficulty?
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
104.15
€
/
Meki uvez
14.39
€
/
Adobe ePub DRM
81.61
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?