We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. To this end statistical comparisons are undertaken of the frequency distributions of data from physical sources--repositories of information such as images, data stored in a hard drive, computer programs and DNA sequences--and the output frequency distributions generated by purely algorithmic means--by running abstract computing devices such as Turing machines, cellular automata and Post Tag systems. Statistical correlations were found and their significance measured
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theor...
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Le...
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Le...
<p>Previously referred to as ‘miraculous’ in the scientific literature because of its powerful prope...
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-C...
This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents ...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
In this paper, we present a theoretical effort to connect the theory of program size to psychology b...
Two experiments were carried out to investigate how Algorithmic Specified Complexity (ASC) might ser...
Scalability is a fundamental problem in computer science. Computer scientists often describe the sc...
Algorithmic complexity provides a mathematical formal notion of string complexity. Building on this,...
We propose a measure based upon the fundamental theoretical concept in algorithmic information theor...
In this paper, we apply different software complexity measures to a set of shortest-path algorithms....
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theor...
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Le...
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Le...
<p>Previously referred to as ‘miraculous’ in the scientific literature because of its powerful prope...
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-C...
This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents ...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
In this paper, we present a theoretical effort to connect the theory of program size to psychology b...
Two experiments were carried out to investigate how Algorithmic Specified Complexity (ASC) might ser...
Scalability is a fundamental problem in computer science. Computer scientists often describe the sc...
Algorithmic complexity provides a mathematical formal notion of string complexity. Building on this,...
We propose a measure based upon the fundamental theoretical concept in algorithmic information theor...
In this paper, we apply different software complexity measures to a set of shortest-path algorithms....
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
The field of computational complexity theory--which chiefly aims to quantify the difficulty encounte...
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theor...