Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Bounded Queries in Recursion Theory
Angličtina
265 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
53.15
€
/
Brožovaná
42.82
€
/
Brožovaná
94.16
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
32.80
€
/
Brožovaná
37.36
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?