Order Total (1 Item Items):
Shipping Destination:
Bounded Queries Recursion Theory by Levine William (19 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (19)
- 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 (17)
- As New, Fine or Near Fine (No further results match this refinement)
- 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 (3)
- Not Print on Demand (15)
Language (1)
Free Shipping
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 4 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.
-
US$ 54.32
Convert currencyUS$ 8.71 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
US$ 59.50
Convert currencyUS$ 11.65 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketCondition: New. pp. 376.
-
US$ 117.99
Convert currencyFree shipping from Australia to U.S.A.Quantity: 1 available
Add to basketBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
US$ 116.44
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 116.90
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Bounded Queries in Recursion Theory (Hardcover)
Published by Birkhauser Boston Inc, Secaucus, 1998
ISBN 10: 0817639667 ISBN 13: 9780817639662
Language: English
Hardcover. Condition: new. Hardcover. 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. 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). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
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
US$ 129.97
Convert currencyUS$ 16.06 shipping 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
US$ 129.97
Convert currencyUS$ 16.06 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 111.25
Convert currencyUS$ 57.35 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 111.25
Convert currencyUS$ 57.35 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New.
-
Condition: New. pp. 374.
-
Bounded Queries in Recursion Theory (Hardcover)
Published by Birkhauser Boston Inc, Secaucus, 1998
ISBN 10: 0817639667 ISBN 13: 9780817639662
Language: English
US$ 251.48
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: new. Hardcover. 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. 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). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
Bounded Queries in Recursion Theory
Published by Springer-Verlag New York Inc., 2013
ISBN 10: 1461268486 ISBN 13: 9781461268482
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 158.34
Convert currencyUS$ 16.45 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 552.
-
Bounded Queries in Recursion Theory
Published by Birkhauser Boston Inc, 1998
ISBN 10: 0817639667 ISBN 13: 9780817639662
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 159.61
Convert currencyUS$ 18.88 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 733.
-
US$ 171.93
Convert currencyUS$ 8.71 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: 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.
-
US$ 186.72
Convert currencyUS$ 11.65 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 374.
