.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Bounded Queries in Computability Theory
Levine, William S.; Gasarch, William; Martin, Georgia
€ 135.05
FREE Delivery in Ireland
Description for Bounded Queries in Computability Theory
Hardback. Recursion theory in theoretical computer science has been a growing area for over a decade. Using a combination of techniques in recursion theory and combinatorics, this work should appeal to advanced undergraduates seeking an introductory course in recursion theory, as well as graduates. Series: Progress in Computer Science and Applied Logic. Num Pages: 353 pages, biography. BIC Classification: PBV; PBW; UY. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 22. Weight in Grams: 703.
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, ... Read more
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, ... Read more
Product Details
Format
Hardback
Publication date
1998
Publisher
Birkhauser Boston Inc United States
Number of pages
353
Condition
New
Series
Progress in Computer Science and Applied Logic
Number of Pages
353
Place of Publication
Secaucus, United States
ISBN
9780817639662
SKU
V9780817639662
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Bounded Queries in Computability Theory
"Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory."
Sigact News
Sigact News