Sprache: Englisch
Verlag: Cambridge University Press, UK, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Anbieter: RIVERLEE BOOKS, Waltham Cross, HERTS, Vereinigtes Königreich
EUR 36,97
Anzahl: 1 verfügbar
In den WarenkorbSoft cover. Zustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 66,70
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Expounds Godel's incompleteness theorey using an information theoretic approach based on the size of computer programs. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 192 pages, black & white illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 189 x 247 x 11. Weight in Grams: 364. . 2008. paperback. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521616042 ISBN 13: 9780521616041
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel'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.