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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert
Algorithmic Information Theory Pb editado por Cambridge
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 13,58 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerEUR 3,53 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerAnbieter: RIVERLEE BOOKS, Waltham Cross, HERTS, Vereinigtes Königreich
Soft 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. Bestandsnummer des Verkäufers 65295
Anzahl: 1 verfügbar
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2416190009519
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780521616041_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9780521616041
Anzahl: 10 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9780521616041
Anzahl: Mehr als 20 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 380. Bestandsnummer des Verkäufers C9780521616041
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 175 pages. 9.75x7.50x0.50 inches. In Stock. This item is printed on demand. Bestandsnummer des Verkäufers __0521616042
Anzahl: 1 verfügbar
Anbieter: Grand Eagle Retail, Fairfield, OH, USA
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9780521616041
Anzahl: 1 verfügbar
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9780521616041
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Expounds G del's incompleteness theorey using an information theoretic approach based on the size of computer programs. Bestandsnummer des Verkäufers 9780521616041
Anzahl: 1 verfügbar