Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)

Martin, Georgia,Levine, William

ISBN 10: 0817639667 / ISBN 13: 9780817639662

Published by Birkhäuser, 1998

About this Item

no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized.

Seller Inventory # mon0000117696

Bibliographic Details

• Title: Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
• Publisher: Birkhäuser
• Publication Date: 1998
• Language: English
• ISBN 10: 0817639667
• ISBN 13: 9780817639662
• Binding: Hardcover
• Condition: Very Good

About this title

Synopsis

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.

Product Description

Bounded Queries in Computability Theory 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. Full description