Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 11.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Bounded Queries in Recursion Theory

Name: Bounded Queries in Recursion Theory
Brand: Springer-Verlag New York Inc.
SKU: 02253490
Price: 103.07 EUR
Availability: InStock
Author: William Levine
ISBN: 9781461268482

William Levine

Georgia Martin

Language

English

Book Paperback

Libristo code: 02253490

Publishers Springer-Verlag New York Inc., July 2013

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

Libristo code: 02253490

249 b

103.07 €

In stock at our supplier Shipping in 5-8 days

30-day return policy

Customers also purchased

Transaktionskostenorientiertes Controlling Der Organisation Und Personalfuhrung Christoph Stein

Paperback

53.35 €

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.