Bounded Queries in Recursion Theory

Name: Bounded Queries in Recursion Theory
Brand: Birkhauser Boston Inc
SKU: 9780817639662
Price: 115.7 EUR
Availability: InStock

Автор: William Gasarch, Georgia Martin

Език:

Корици: С твърди корици

Издател: Birkhauser Boston Inc

Наличност: Външен склад в ограничено количество

Изпращаме след 13-18 дни

115.70 € 226.30 лв

One of the major concerns of theoretical computer science is the classifi cation of problems in term...

Информация за книгата

Автор

William Gasarch, Georgia Martin

Език

Английски език

Корици

Книга - С твърди корици

Издадена

1998

страници

353

EAN

9780817639662

ISBN

0817639667

Enbook ID

01399169

Издател

Birkhauser Boston Inc

Теглоt

1550

Размери

155 x 235 x 25

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Bounded Queries in Recursion Theory

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също