Inductive inference: Theory and methods
D Angluin, CH Smith - ACM computing surveys (CSUR), 1983 - dl.acm.org
There has been a great deal of theoretical and experimental work in computer science on
inductive inference systems, that is, systems that try to infer general rules from examples …
inductive inference systems, that is, systems that try to infer general rules from examples …
[BOOK][B] An introduction to Kolmogorov complexity and its applications
Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …
[BOOK][B] Algorithmic randomness and complexity
RG Downey, DR Hirschfeldt - 2010 - books.google.com
This book is concerned with the theory of computability and complexity over the real
numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur …
numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur …
[BOOK][B] Universal artificial intelligence: Sequential decisions based on algorithmic probability
M Hutter - 2005 - books.google.com
Personal motivation. The dream of creating artificial devices that reach or outperform human
inteUigence is an old one. It is also one of the dreams of my youth, which have never left me …
inteUigence is an old one. It is also one of the dreams of my youth, which have never left me …
[BOOK][B] Logical depth and physical complexity
CH Bennett - 1988 - Citeseer
Some mathematical and natural objects (a random sequence, a sequence of zeros, a perfect
crystal, a gas) are intuitively trivial, while others (eg the human body, the digits of π) contain …
crystal, a gas) are intuitively trivial, while others (eg the human body, the digits of π) contain …
[CITATION][C] Information and randomness: an algorithmic perspective
CS Calude - 2013 - books.google.com
The first edition of the monograph Information and Randomness: An Algorithmic Perspective
by Crist ian Calude was published in 1994. In my Foreword I said:" The research in …
by Crist ian Calude was published in 1994. In my Foreword I said:" The research in …
Can an individual sequence of zeros and ones be random?
VA Uspenskii, AL Semenov… - Russian Mathematical …, 1990 - iopscience.iop.org
Abstract CONTENTS Introduction Chapter I. The main notions and facts § 1.1. The notion of
randomness depends on a given probability distribution § 1.2. Three faces of randomness …
randomness depends on a given probability distribution § 1.2. Three faces of randomness …
Minimum description length induction, Bayesianism, and Kolmogorov complexity
PMB Vitányi, M Li - IEEE Transactions on information theory, 2000 - ieeexplore.ieee.org
The relationship between the Bayesian approach and the minimum description length
approach is established. We sharpen and clarify the general modeling principles minimum …
approach is established. We sharpen and clarify the general modeling principles minimum …
[BOOK][B] Randomness and undecidability in physics
K Svozil - 1993 - books.google.com
Recent findings in the computer sciences, discrete mathematics, formal logics and
metamathematics have opened up a royal road for the investigation of undecidability and …
metamathematics have opened up a royal road for the investigation of undecidability and …
Uniform test of algorithmic randomness over a general space
P Gács - Theoretical Computer Science, 2005 - Elsevier
The algorithmic theory of randomness is well developed when the underlying space is the
set of finite or infinite sequences and the underlying probability distribution is the uniform …
set of finite or infinite sequences and the underlying probability distribution is the uniform …