Order Total (1 Item Items):
Shipping Destination:
Bounded Queries Recursion Theory by Levine William (18 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (18)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (15)
- As New, Fine or Near Fine (1)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (7)
- Not Print on Demand (14)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Seller: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized.
-
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Seller: Orca Knowledge Systems, Inc., Novato, CA, U.S.A.
Seller rating 5 out of 5 stars
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 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.
-
Condition: New. pp. 376.
-
Condition: New. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Condition: New. pp. 376.
-
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic, 16)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 96.15
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
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
£ 96.15
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New.
-
Condition: New. pp. 374.
-
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, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Gebunden. Condition: New.
-
Bounded Queries in Recursion Theory
Language: English
Published by Birkhäuser, Birkhäuser, 2013
ISBN 10: 1461268486 ISBN 13: 9781461268482
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.
-
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Bounded Queries in Recursion Theory
Language: English
Published by Birkhauser Boston Dez 1998, 1998
ISBN 10: 0817639667 ISBN 13: 9780817639662
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 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.
-
Condition: new. Questo è un articolo print on demand.
-
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.
-
Condition: New. PRINT ON DEMAND pp. 374.
-
Bounded Queries in Recursion Theory
Language: English
Published by Birkhäuser, Birkhäuser Jul 2013, 2013
ISBN 10: 1461268486 ISBN 13: 9781461268482
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 Nature c/o IBS, Benzstrasse 21, 48619 Heek 372 pp. Englisch.
