Information and Randomness
Subtitle: An Algorithmic Perspective
By: by Cristian S. Calude
Edition: Second Edition, Revised and Extended.
Series: Texts in Theoretical Computer Science An EATCS Series; Texts in Theoretical Computer Science An EATCS Series
Publisher: Springer Berlin Heidelberg
Published: 2002
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] :
Number of pages: 468
ISBN-13: 9783642077937; 9783662049785
Subjects: Combinatorics; Coding theory; Computer science; Computer software
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.