Algorithmic Information Theory (Paperback)
Gregory J. Chaitin
Verkauft von CitiRetail, Stevenage, Vereinigtes Königreich
AbeBooks-Verkäufer seit 29. Juni 2022
Neu - Softcover
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenVerkauft von CitiRetail, Stevenage, Vereinigtes Königreich
AbeBooks-Verkäufer seit 29. Juni 2022
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenPaperback. 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.
Bestandsnummer des Verkäufers 9780521616041
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Orders can be returned within 30 days of receipt.
Please note that titles are dispatched from our US, Canadian or Australian warehouses. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 7-14 days.