Bounded Queries in Recursion Theory (Hardcover, 1999 ed.)

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."

General

Imprint:	Birkhauser Boston
Country of origin:	United States
Series:	Progress in Computer Science and Applied Logic, 16
Release date:	2001
First published:	1999
Authors:	William Levine • Georgia Martin
Dimensions:	235 x 155 x 22mm (L x W x T)
Format:	Hardcover
Pages:	353
Edition:	1999 ed.
ISBN-13:	978-0-8176-3966-2
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	0-8176-3966-7
Barcode:	9780817639662

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!