Order Total (1 Item Items):
Shipping Destination:
Recursion Theory Computational Complexity (8 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (8)
- 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 (5)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (8)
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 (6)
- Not Print on Demand (6)
Language (2)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
-
Condition: As New. Unread book in perfect condition.
-
Recursion Theory and Computational Complexity: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in ... 14-23, 1979 (C.I.M.E. Summer Schools, 79)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 49.86
US$ 15.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Recursion theory and computational complexity
Seller: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, United Kingdom
Seller rating 5 out of 5 stars
Condition: Poor. Covers edges are lightly scuffed. Endpapers have marks and inscription. Pages toned with some light age marks to first 50 or so pages otherwise clean throughout.
-
Recursion Theory and Computational Complexity : Lectures Given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.), Held in Bressanone (Bolzano), Italy, June 14-23, 1979
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 49.85
US$ 20.00 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Recursion Theory and Computational Complexity : Lectures Given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.), Held in Bressanone (Bolzano), Italy, June 14-23, 1979
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 55.93
US$ 20.00 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Recursion Theory and Computational Complexity
Language: English
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642110711 ISBN 13: 9783642110719
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Now available with SpringerS. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the.
-
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, states that for any function (n) log(n). In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of that space bound. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements.
