Item description for Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science. An EATCS Series) by Cristian S. Calude...
The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge.
"Professor Calude has produced a first-rate exposition of up-to-date work in information and randomness." D.S. Bridges, Canterbury University, co-author, with Errett Bishop, of Constructive Analysis;
"The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician;
"This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.4" Width: 6.3" Height: 0.9" Weight: 1.65 lbs.
Release Date Nov 11, 2002
ISBN 3540434666 ISBN13 9783540434665
Availability 141 units. Availability accurate as of May 23, 2017 06:54.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
Reviews - What do customers think about Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science. An EATCS Series)?
Classical ideas with modern use. Oct 9, 2004
I stumbled over this (lovely) book a little by accident. As I kept reading, my enthusiasm for the book gradually increased. While the book is addressed perhaps more to students in computation and in CS, it is very attractive also as a text to be used in mainstream mathematics, and in probability theory.
It begins with a new look at the classical Kolmogorov construction of measures on infinite product spaces, and asks for explicit ways of labeling them with a class of certain concrete numerical functions. Then it moves onto noiseless coding theory (from communications science), but it stays rooted firmly in classical ideas from Shannon-Kolmogorov communication and information theory.
It is indeed pleasing to see that God still plays dice, not only in quantum theory, but also in such classical areas of math as in number theory. From the foreword: "...putting Shannon's information theory and Turing's computability theory into a cocktail shaker, and shaking vigorously..."
The book is a second edition 2002, with a number of attractive additions to the first edition from 1994. It will likely work equally well in a course, as for self-study. The main portion in the book focuses on classical and modern topics in computability, and its connections to randomness; covering concrete halting problems, chaos, cellular automata, algorithms, and their complexity. Palle Jorgensen, October 2004.