Items related to Bounded Queries in Recursion Theory (Progress in Computer...
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.
"synopsis" may belong to another edition of this title.
Review
"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
"About this title" may belong to another edition of this title.
Buy New
View this item
US$ 90.72
US$ 21.15 shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for Bounded Queries in Recursion Theory (Progress in Computer...
Stock Image
Bounded Queries in Recursion Theory
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9781461268482
Quantity: 10 available
Seller Image
Bounded Queries in Recursion Theory
Published by
Birkhäuser Boston Jul 2013, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 372 pp. Englisch. Seller Inventory # 9781461268482
Quantity: 2 available
Stock Image
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2716030028322
Quantity: Over 20 available
Stock Image
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461268482_new
Quantity: Over 20 available
Seller Image
Bounded Queries in Recursion Theory
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4189485
Quantity: Over 20 available
Seller Image
Bounded Queries in Recursion Theory
Published by
Birkhäuser Boston, Birkhäuser Boston, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9781461268482
Quantity: 1 available
Stock Image
Bounded Queries in Recursion Theory
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 374. Seller Inventory # 2697522264
Quantity: 4 available
Stock Image
Bounded Queries in Recursion Theory
Published by
Springer-Verlag New York Inc., 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 552. Seller Inventory # C9781461268482
Quantity: Over 20 available
Stock Image
Bounded Queries in Recursion Theory
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 374 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 94875015
Quantity: 4 available
Seller Image
Bounded Queries in Recursion Theory
Published by
Birkhäuser Boston, Birkhäuser Boston Jul 2013, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 372 pp. Englisch. Seller Inventory # 9781461268482
Quantity: 1 available