Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Bounded Queries in Recursion Theory
Engleski
265 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
53.00
€
/
Meki uvez
42.70
€
/
Meki uvez
93.89
€
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
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
34.42
€
/
Meki uvez
39.17
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?