𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Information, randomness and incompleteness. Papers on algorithmic information theory

✍ Scribed by Gregory J. Chaitin

Book ID
127425175
Publisher
World Scientific
Year
1990
Tongue
English
Weight
2 MB
Series
World Scientific Series in Computer Science
Edition
2 Sub
Category
Library
ISBN
9810201540

No coin nor oath required. For personal study only.

✦ Synopsis

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, and an essay on biology. Its new larger format makes it easier to read. Chaitin's ideas are a fundamental extension of those of GΓΆdel and Turing 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.

πŸ“œ SIMILAR VOLUMES

Information and Randomness: An Algorithm
Information and Randomness: An Algorithmic Perspective
✍ Cristian Calude πŸ“‚ Library πŸ“… 1994 πŸ› Springer 🌐 English βš– 2 MB

"Algorithmic information theory (AIT) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously", says G.J. Chaitin, one of the fathers of this theory of complexity and randomness, which is also known as Kolmogorov complexit

An introduction to algorithmic informati
An introduction to algorithmic information theory
✍ George Markowsky πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 2 views

he goal of this paper is to provide a simple introduction to Algorithmic Information Theory (AIT) that will highlight some of the main ideas without presenting too many details. More technical treatments of these ideas can be found in References [1], [2], [3] and [4], which are listed at the end of

Prediction algorithms and confidence mea
Prediction algorithms and confidence measures based on algorithmic randomness theory
✍ Alex Gammerman; Volodya Vovk πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 104 KB

This paper reviews some theoretical and experimental developments in building computable approximations of Kolmogorov's algorithmic notion of randomness. Based on these approximations a new set of machine learning algorithms have been developed that can be used not just to make predictions but also