Results 1  10
of
20
Uniform test of algorithmic randomness over a general space
 Theoretical Computer Science
, 2005
"... ABSTRACT. 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 distribution or a computable distribution. These restrictions seem artificial. Some progress has been made ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
ABSTRACT. 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 distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by MartinLöf), and to arbitrary distributions (by Levin). We recall the main ideas and problems of Levin’s theory, and report further progress in the same framework. The issues are the following: – Allow noncompact spaces (like the space of continuous functions, underlying the Brownian motion). – The uniform test (deficiency of randomness) dP (x) (depending both on the outcome x and the measure P) should be defined in a general and natural way. – See which of the old results survive: existence of universal tests, conservation of randomness, expression of tests in terms of description complexity, existence of a universal measure, expression of mutual information as ”deficiency of independence”. – The negative of the new randomness test is shown to be a generalization of complexity in continuous spaces; we show that the addition theorem survives. The paper’s main contribution is introducing an appropriate framework for studying these questions and related ones (like statistics for a general family of distributions). 1.
Information Distance
, 1997
"... While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal inf ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal information metric, based on length of shortest programs for either ordinary computations or reversible (dissipationless) computations. It turns out that these definitions are equivalent up to an additive logarithmic term. We show that the information distance is a universal cognitive similarity distance. We investigate the maximal correlation of the shortest programs involved, the maximal uncorrelation of programs (a generalization of the SlepianWolf theorem of classical information theory), and the density properties of the discrete metric spaces induced by the information distances. A related distance measures the amount of nonreversibility of a computation. Using the physical theo...
What is Complexity?  The philosophy of complexity per se with application to some examples in evolution.
"... 2 It is argued that complexity has only a lim ited use as a paradigm against reductionist approaches and that it has a much richer potential as a comparable property. What can complexity be usefully said to be a property of is discussed. It is argued that it is unlikely to have any useful value ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
2 It is argued that complexity has only a lim ited use as a paradigm against reductionist approaches and that it has a much richer potential as a comparable property. What can complexity be usefully said to be a property of is discussed. It is argued that it is unlikely to have any useful value as applied to "real" objects or sy stems. Further that even relativising it to an observer has problems. It is proposed that complexity can usefully be applied only to constructions within a given language. It is argued that complexity is usefully differentiated from the concepts of size, ignorance, variety , minimum description length and order. A definition of complexity is proposed which can be summarised as "that property of a language expression which makes it difficult to formulate its overall behaviour even when given almost complete information about its atomic components and their interrelations.". Some of the consequences of this definition are discussed. It is shown that...
Algorithmic Theories Of Everything
, 2000
"... The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong inductive bias. We show that P(x) is small for any universe x lac ..."
Abstract

Cited by 31 (15 self)
 Add to MetaCart
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong inductive bias. We show that P(x) is small for any universe x lacking a short description, and study the spectrum of TOEs spanned by two Ps, one reflecting the most compact constructive descriptions, the other the fastest way of computing everything. The former derives from generalizations of traditional computability, Solomonoff’s algorithmic probability, Kolmogorov complexity, and objects more random than Chaitin’s Omega, the latter from Levin’s universal search and a natural resourceoriented postulate: the cumulative prior probability of all x incomputable within time t by this optimal algorithm should be 1/t. Between both Ps we find a universal cumulatively enumerable measure that dominates traditional enumerable measures; any such CEM must assign low probability to any universe lacking a short enumerating program. We derive Pspecific consequences for evolving observers, inductive reasoning, quantum physics, philosophy, and the expected duration of our universe.
On causally asymmetric versions of Occam’s Razor and their relation to thermodynamics
, 2007
"... and their relation to thermodynamics ..."
The Boltzmann Entropy and Randomness Tests
, 1994
"... In the context of the dynamical systems of classical mechanics, we introduce two new notions called \algorithmic negrain and coarsegrain entropy". The negrain algorithmic entropy is, on the one hand, a simple variant of the randomness tests of MartinLof (and others) and is, on the other ha ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In the context of the dynamical systems of classical mechanics, we introduce two new notions called \algorithmic negrain and coarsegrain entropy". The negrain algorithmic entropy is, on the one hand, a simple variant of the randomness tests of MartinLof (and others) and is, on the other hand, a connecting link between description (Kolmogorov) complexity, Gibbs entropy and Boltzmann entropy.
Entropy of Scene Visibility
, 1999
"... We propose a new approach, based on information theory, to study the visibility of a scene. Thus, we will define the concepts of entropy and mutual information applied to 3D scene visibility. Mainly, we analize the concept of entropy (or randomness) of scene visibility and we examine the relationshi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We propose a new approach, based on information theory, to study the visibility of a scene. Thus, we will define the concepts of entropy and mutual information applied to 3D scene visibility. Mainly, we analize the concept of entropy (or randomness) of scene visibility and we examine the relationship between entropy of scene visibility and the expected value of the mean square error for all form factors. Next, these concepts are applied to diverse sample scenes and the accuracy of the values presented is analyzed. Key Words: Rendering, Radiosity, Monte Carlo, Information Theory, Entropy 1 Introduction In this paper, the visibility of a scene, which is directly related to form factors [1], is analyzed from the viewpoint of information theory. In many different fields, the concept of entropy has been studied at length and has been used as a starting point in order to study complexity [6, 10, 18, 19]. In our case, we study the entropy of scene visibility and leave the study of scene com...
Philosophical Issues in Kolmogorov Complexity
 In Proceedings on Automata, Languages and Programming (ICALP92
, 1992
"... this article at a conceptual level, it is sufficient to know that Kolmogorov complexity of a finite string x ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this article at a conceptual level, it is sufficient to know that Kolmogorov complexity of a finite string x
An InformationTheory Framework for the Study of the Complexity of Visibility and Radiosity in a Scene
, 2002
"... this dissertation. 1.1 Radiosity, Complexity, and Information Theory The three fundamental pillars of this thesis are radiosity, complexity, and information theory: One of the most important topics in computer graphics is the accurate computation of the global illumination in a closed virtual ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this dissertation. 1.1 Radiosity, Complexity, and Information Theory The three fundamental pillars of this thesis are radiosity, complexity, and information theory: One of the most important topics in computer graphics is the accurate computation of the global illumination in a closed virtual environment (scene), i.e. the intensities of light over all its surfaces. "The production of realistic images requires in particular a precise treatment of lighting e#ects that can be achieved by simulating the underlying physical phenomena of light emission, propagation, and reflection"[82]. This type of simulation is called global illumination and is represented by the rendering equation [43], which is a Fredholm integral equation of the second kind. However obtaining an exact representation of the illumination is an intractable problem. Many di#erent techniques are used to obtain an approximate quantification of it [12, 82, 33]
Date, Chairperson Quantum Information Theory By
, 1951
"... This dissertation is approved, and it is acceptable in quality and form for publication on micro lm: Approved by the Dissertation Committee: Accepted: ..."
Abstract
 Add to MetaCart
This dissertation is approved, and it is acceptable in quality and form for publication on micro lm: Approved by the Dissertation Committee: Accepted: