Bounded Queries Recursion Theory by Levine William (18 results)
- Hardcover
Seller: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.Midtown Scholar Bookstore
Contact seller5-star sellerCondition: Used - Very good
US$ 13.61
US$ 6.00 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: Very Good. no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized.
- Hardcover
Seller: Orca Knowledge Systems, Inc., Novato, CA, U.S.A.Orca Knowledge Systems, Inc.
Contact seller5-star sellerCondition: Used - Good
US$ 27.95
US$ 5.95 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: Good. First Edition. No DJ. Ex University of California, Berkeley library book with usual library markings. Binding is tight, text clean. From the back cover: One of the major concerns of theoretical computer science is the classification of problems in terms of how hard they are. The natural measure of dif…ficulty 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.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: Used
US$ 125.90
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: Used. pp. 376.
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: Used
US$ 129.49
US$ 8.61 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Used. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
- Hardcover
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: Used
US$ 135.90
US$ 11.36 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Used. pp. 376.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 132.26
US$ 15.88 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 132.26
US$ 15.88 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 108.53
US$ 55.94 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 165.99
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 374.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 111.91
US$ 79.94 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Bounded Queries in Recursion Theory | William Levine (u. a.) | Taschenbuch | Progress in Computer Science and Applied Logic | xiii | Englisch | 2013 | Birkhäuser | EAN 9781461268482 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 1419…7 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 165.18
US$ 33.13 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 134.51
US$ 71.74 shippingShips from Germany to U.S.A.Quantity: 1 available
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 t…he 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.
- Hardcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 150.37
US$ 55.94 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 185.68
US$ 72.65 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. 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 al…so 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.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
US$ 101.44
US$ 7.77 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 173.36
US$ 8.61 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
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.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 182.91
US$ 11.36 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 374.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 125.84
US$ 68.52 shippingShips from Germany to U.S.A.Quantity: 1 available
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 Nature c/o IBS, Benzstrasse 21, 48619 Heek 372 pp. Englisch.
