|
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Functional analysis
|
Buy Now
Bounded Queries in Recursion Theory (Paperback, Softcover reprint of the original 1st ed. 1999)
Loot Price: R2,674
Discovery Miles 26 740
|
|
|
Bounded Queries in Recursion Theory (Paperback, Softcover reprint of the original 1st ed. 1999)
Series: Progress in Computer Science and Applied Logic, 16
Expected to ship within 18 - 22 working days
|
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
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!
|
You might also like..
Theory
Steven Lord, Fedor Sukochev, …
Hardcover
R4,141
Discovery Miles 41 410
See more
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
