scientific article; zbMATH DE number 1142293

Cited in

(36)

Instability, complexity, and evolution
Kolmogorov complexity and random graphs
Almost everywhere high nonuniform complexity
Inductive reasoning and Kolmogorov complexity
Average case complexity under the universal distribution equals worst- case complexity
Circuit size relative to pseudorandom oracles
The complexity of matrix transposition on one-tape off-line Turing machines with output tape
Note on the topological structure of random strings
Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity
Computational depth and reducibility
The Kolmogorov expressive power of Boolean query languages
Inferring a DNA sequence from erroneous copies
Protocols for asymmetric communication channels
Presentations of computably enumerable reals.
Compressibility, laws of nature, initial conditions and complexity
Geometry of the space of triangulations of a compact manifold
Towards an algorithmic theory of adaptation
Leveraging environmental correlations: the thermodynamics of requisite variety
On Kolmogorov complexity in the real Turing machine setting
The complexity of on-line simulations between multidimensional turing machines and random access machines
Current research on Gödel's incompleteness theorems
The combinatorial complexity of a finite string
Philosophical issues in Kolmogorov complexity
Functional programs as compressed data
Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable
The problem of survival from an algorithmic point of view
The evolution of human communication and the information revolution --- A mathematical perspective
Fourier transform bounded Kolmogorov complexity
Randomness as an invariant for number representations
Comparing descriptional and computational complexity of infinite words
Approximation and fixed parameter algorithms for the approximate cover problem
A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law
On the power of several queues
Linear speed-up does not hold on Turing machines with tree storages
On relative randomness
PAC learning and Occam's razor: probably approximately incorrect

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385509)