Контакт
Как се пазарува?
Доставка
Наръчник за пазаруване
Bounded Queries in Recursion Theory
Английски език
263 b
До 30 дни за връщане на стоки
Клиентите са закупили също
/
С меки корици
55.65
€
108.85 лв
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.
Информация за книгата
Английски език
Подарете тази книга днес
Лесно е
1 Добавете книгата в количката си и изберете Доставка като подарък 2 В замяна ще ви изпратим ваучер 3 Книгата ще пристигне на адреса на получателяМоже би ще Ви заинтересува
/
С меки корици
46.21
€
90.38 лв
/
С меки корици
395.89
€
774.30 лв
/
С меки корици
8.51
€
16.64 лв
