Information, randomness and incompleteness : papers on algorithmic information theory / by S.J. Chaitin..
By: Chaitin, Gregory J
.
Material type: 
BookSeries: Series in computer science ; vol. 8.Publisher: Singapore. New Jersey : World Scientific, 1990Edition: 2nd ed.Description: v, 320 p. ; 26 cm. + hbk.ISBN: 9810201540; 9810201710 (pbk.).Subject(s): Electronic data processing | Computer algorithms | Information theoryDDC classification: 511.3 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 511.3 (Browse shelf(Opens below)) | 1 | Available | 00022620 |
Enhanced descriptions from Syndetics:
This book contains in easily accessible form all the main ideas of the creator and principal architect of algorithmic information theory. This expanded second edition has added thirteen abstracts, a 1988 Scientific American Article, a transcript of a EUROPALIA 89 lecture, an essay on biology, and an extensive bibliography. Its new larger format makes it easier to read. Chaitin's ideas are a fundamental extension of those of G del and Turning and have exploded some basic assumptions of mathematics and thrown new light on the scientific method, epistemology, probability theory, and of course computer science and information theory.
Bibliography: (pages 299-304).
Part I: Introductory/tutorial/survey papers -- Part II: Applications to metamathematics -- Part III: Applications to biology -- Part IV: Technical papers on self deliminating programs -- Part V: Technical papers on blank-endmark programs -- Part VI: Technical papers on turing machines and LISP -- Part VII: Abstracts.