Articoli correlati a Algorithmic Information Theory
Sinossi
Expounds Gödel's incompleteness theorey using an information theoretic approach based on the size of computer programs.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione del libro
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.
Contenuti
Foreword; Preface; Figures; 1. Introduction; Part I. Formalisms for Computation: Register Machines, Exponential Diophantine Equations, and Pure LISP: 2. The arithmetization of register machines; 3. A version of Pure LISP; 4. The LISP interpreter EVAL; Part II. Program Size, Halting Probabilities, Randomness, and Metamathematics: 5. Conceptual development; 6. Program size; 7. Randomness; 8. Incompleteness; 9. Conclusion; Bibliography.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreCambridge University Press
- Data di pubblicazione2008
- ISBN 10 0521616042
- ISBN 13 9780521616041
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine192
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 65,36
EUR 8,98 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costi
Risultati della ricerca per Algorithmic Information Theory
Foto dell'editore
Algorithmic Information Theory
Editore:
Cambridge University Press, UK, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Antico o usato
Soft cover
Da: RIVERLEE BOOKS, Waltham Cross, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Soft cover. Condizione: 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. Codice articolo 65295
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Information Theory
Editore:
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 380. Codice articolo C9780521616041
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Information Theory
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 175 pages. 9.75x7.50x0.50 inches. In Stock. This item is printed on demand. Codice articolo __0521616042
Quantità: 1 disponibili
Immagini fornite dal venditore
Algorithmic Information Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.Inhaltsverzeichnis. Codice articolo 446942335
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521616041_new
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)
Editore:
Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521616042
ISBN 13: 9780521616041
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521616041
Quantità: 10 disponibili
Immagini fornite dal venditore
Algorithmic Information Theory
Editore:
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9780521616041
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Information Theory (Paperback)
Editore:
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521616041
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Information Theory (Paperback)
Editore:
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Nuovo
Paperback
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 3 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521616041
Quantità: 1 disponibili
Foto dell'editore
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190009519
Quantità: Più di 20 disponibili