Information, Randomness & Incompleteness : Papers on Algorithmic Information Theory by G. J. Chaitin (1987, Hardcover)
B
Bookbarn87 (4439)
99.5% positive Feedback
Price:
US $15.99
Approximately£11.89
+ $14.00 postage
Estimated by Mon, 25 Aug - Tue, 2 SepEstimated delivery Mon, 25 Aug - Tue, 2 Sep
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:
Very GoodVery Good
INFORMATION, RANDOMNESS & INCOMPLETENESS: PAPERS ON ALGORITHMIC INFORMATION THEORY (World Scientific Computer Science). Title : INFORMATION, RANDOMNESS & INCOMPLETENESS: PAPERS ON ALGORITHMIC INFORMATION THEORY (World Scientific Computer Science).
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
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
LanguageEnglish
Publication NameInformation, Randomness & Incompleteness : Papers on Algorithmic Information Theory
Publication Year1987
SubjectProbability & Statistics / Stochastic Processes, Computer Science, Library & Information Science / General
TypeTextbook
AuthorG. J. Chaitin
Subject AreaMathematics, Computers, Language Arts & Disciplines
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.