Order Total (1 Item Items):
Shipping Destination:
Algorithmic Information Theory by Chaitin Gregory (47 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (47)
- 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 (32)
- As New, Fine or Near Fine (3)
- Very Good or Good (12)
- 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 (10)
- Not Print on Demand (42)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
INFORMATION, RANDOMNESS & INCOMPLETENESS: PAPERS ON ALGORITHMIC INFORMATION THEORY (World Scientific Computer Science)
Published by World Scientific Publishing Comp, 1987
ISBN 10: 9971504790 ISBN 13: 9789971504793
Language: English
hardcover. Condition: Very Good. Fast Shipping - Safe and Secure 7 days a week!
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
Condition: good. Used book in good condition. May have some wear to binding, spine, cover, and pages. Some light highlighting markings writing may be present. May have some stickers and or sticker residue present. May be Ex-lib. copy. May NOT include discs, or access code or other supplemental material. We ship Monday-Saturday and respond to inquiries within 24 hours.
-
paperback. Condition: Very Good. Fast Shipping - Safe and Secure 7 days a week!
-
Information, Randomness and Incompleteness: Papers on Algorithmic Information Theory (World Scientific Computer Science)
Published by World Scientific Publishing Company, Singapore, Teaneck, NJ, USA, 1987
ISBN 10: 9971504804 ISBN 13: 9789971504809
Language: English
Seller: Gebrauchtbücherlogistik H.J. Lauterbach, Gummersbach, NRW, Germany
Seller rating 5 out of 5 stars
US$ 17.28
Convert currencyUS$ 21.71 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBroschiert. Condition: Gut. 21,5 cm X, 272 S. :. Broschiert. Sprache: Englisch, Zustand: Gut min. gebräunt (Innen); Einband (Außen) hat leichte Gebrauchsspuren; Buchrücken leicht lichtrandig; * Die Photos sind original von uns erstellt worden, u.a. erkennbar an einem kleinen weißen Stück Papier im oberen Schnitt. Ab und an verwenden Suchmaschinen Verlagsphotos, bei den Portalen selbst, werden aber nur unsere Originalphotos gezeigt.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
US$ 37.30
Convert currencyUS$ 7.55 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
US$ 38.93
Convert currencyUS$ 8.90 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.
-
Algorithmic Information Theory
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
US$ 36.03
Convert currencyUS$ 10.78 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Very Good. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
US$ 36.14
Convert currencyUS$ 21.55 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books.
-
Algorithmic Information Theory.
Published by Cambridge University Press, 1987
ISBN 10: 0521343062 ISBN 13: 9780521343060
Language: English
Hardcover. Condition: Very Good-. Light wear and rubbing to the spine edges and corners.; Cambridge Tracts In Theoretical Computer Science, Series Number 1; 7.25 X 0.75 X 10 inches; 192 pages.
-
Algorithmic Information Theory
Published by Cambridge University Press, UK, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
Seller: RIVERLEE BOOKS, Waltham Cross, HERTS, United Kingdom
Seller rating 5 out of 5 stars
US$ 43.04
Convert currencyUS$ 20.96 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketSoft cover. Condition: Very Good. Very good condition soft cover, light wear to the cover and spine, ex academic library book with all the usual marks and labels, otherwise in a very good condition inside and out.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
US$ 67.74
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
Condition: New. SUPER FAST SHIPPING.
-
Algorithmic Information Theory (Paperback)
Published by Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
Paperback. Condition: new. Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
US$ 82.12
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. SUPER FAST SHIPPING.
-
US$ 81.28
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Information Randomness and Incompleteness: Papers on Algorithmic Information Theory: 8
Published by World Scientific Pub Co Inc, 1990
ISBN 10: 9810201710 ISBN 13: 9789810201715
Language: English
Seller: Libro Co. Italia Srl, San Casciano Val di Pesa, FI, Italy
Seller rating 5 out of 5 stars
US$ 63.03
Convert currencyUS$ 24.64 shipping from Italy to U.S.A.Quantity: 1 available
Add to basketBrossura. Condition: fine. 1990; br., pp. 320, cm 25x19. Libro.
-
Information, Randomness and Incompleteness: Papers on Algorithmic Information Theory
Published by World Scientific Publishing Company, 1987
ISBN 10: 9971504804 ISBN 13: 9789971504809
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 85.12
Convert currencyUS$ 5.61 shipping from United Kingdom to U.S.A.Quantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
US$ 86.14
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 75.16
Convert currencyUS$ 16.15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New.
-
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)
Published by Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
US$ 73.60
Convert currencyUS$ 20.88 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Algorithmic Information Theory
Published by Cambridge University Press CUP, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
Condition: New. pp. 192.
-
Information, Randomness and Incompleteness : Papers on Algorithmic Information Theory
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 85.11
Convert currencyUS$ 20.22 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory (World Scientific Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 91.82
Convert currencyUS$ 16.15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Information, Randomness and Incompleteness : Papers on Algorithmic Information Theory
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 91.48
Convert currencyUS$ 20.22 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
paperback. Condition: New. In shrink wrap. Looks like an interesting title!
-
Algorithmic Information Theory (Paperback)
Published by Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
US$ 83.29
Convert currencyUS$ 49.87 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: new. Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Algorithmic Information Theory (Paperback)
Published by Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Language: English
US$ 107.40
Convert currencyUS$ 37.00 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: new. Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
