Picture 1 of 1

Stock photo

Information, Randomness &... (V8) by Gregory J Chaitin: New - Picture 1 of 1

Information, Randomness & Incompleteness : Papers on Algorithmic Information Theory by G. J. Chaitin (1987, Hardcover)

AlibrisBooks (457668)

98.5% positive Feedback

Price:

US $181.72

Approximately£132.37

+ $18.89 postage

Estimated delivery Fri, 11 Jul - Mon, 21 Jul

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

New Hard cover

About this product

Product Identifiers

PublisherWorld Industries Scientific Publishing Co Pte LTD

ISBN-109971504790

ISBN-139789971504793

eBay Product ID (ePID)4492050

Product Key Features

Number of Pages284 Pages

Publication NameInformation, Randomness & Incompleteness : Papers on Algorithmic Information Theory

LanguageEnglish

SubjectProbability & Statistics / Stochastic Processes, Computer Science, Library & Information Science / General

Publication Year1987

TypeTextbook

Subject AreaMathematics, Computers, Language Arts & Disciplines

AuthorG. J. Chaitin

FormatHardcover

Dimensions

Item Weight0 Oz

Item Length9.1 in

Item Width5.9 in

Additional Product Features

Intended AudienceCollege Audience

IllustratedYes

SynopsisThe papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on "Algorithmic Information Theory" by the author. There the strongest possible version of Gödel's incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics., The papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on "Algorithmic Information Theory" by the author. There the strongest possible version of G del's incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics.