hardcover. Condition: Very Good. Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997: 2 (De Gruyter Series in Logic & its Applications, 2) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.
hardcover. Condition: Very Good. This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Seller: Orca Knowledge Systems, Inc., Novato, CA, U.S.A.
Hardcover. Condition: Fine. Dust Jacket Condition: DJ not issued. DJ not issued. Unread, unmarked book. DJ rubbings.
Published by Berlin, Walter de Gruyter, 1999
ISBN 10: 3110165872 ISBN 13: 9783110165876
Language: English
First Edition
Hardcover. Condition: Wie neu. 1. Auflage. (de Gruyter Series in Logic and its Applications, 2); VIII, 239 pages.
Seller: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Condition: Good. Walter De Gruyter, 1999. Front cover: slight rubbing, two small scratches, top right corner slightly bent; slight rubbing on back cover and spine; former owner's bookplate inside front cover; binding tight; cover, edges, interior clean and intact; due to the weight of this item, additional shipping charges may apply. hardcover. Good. 8vo - over 7¾" - 9¾" tall.
gebundene Ausgabe. Condition: Gut. 929 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1635.
Published by Walter de Gruyter, Berlin, 1999
ISBN 10: 3110165872 ISBN 13: 9783110165876
Language: English
Seller: J. HOOD, BOOKSELLERS, ABAA/ILAB, Baldwin City, KS, U.S.A.
Hardcover. 239pp. Some neat highlighting on 2 pages, else very good plus, tight & bright condition.
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Hardcover. Condition: Fine.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In.
Condition: New.
Condition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Condition: As New. Unread book in perfect condition.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Condition: New. In.
Published by De Gruyter, De Gruyter Okt 2001, 2001
ISBN 10: 3110168103 ISBN 13: 9783110168105
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Buch. Condition: Neu. Neuware -The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis.The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 180 pp. Englisch.
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Hardback. Condition: New. Reprint 2010. The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Hardback. Condition: New. Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Condition: New. In.
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Hardcover. Condition: Brand New. 212 pages. 9.44x6.69x0.94 inches. In Stock.
Condition: New.
Condition: New. In.
Hardcover. xi, 369 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. D03820 9783110163681 Sprache: Englisch Gewicht in Gramm: 1150.