scientific article; zbMATH DE number 1142293
From MaRDI portal
Publication:4385509
zbMath0900.68264MaRDI QIDQ4385509
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (34)
Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable ⋮ Computational depth and reducibility ⋮ On Kolmogorov complexity in the real Turing machine setting ⋮ The evolution of human communication and the information revolution --- A mathematical perspective ⋮ The complexity of on-line simulations between multidimensional turing machines and random access machines ⋮ Leveraging environmental correlations: the thermodynamics of requisite variety ⋮ Geometry of the space of triangulations of a compact manifold ⋮ The Kolmogorov expressive power of Boolean query languages ⋮ The combinatorial complexity of a finite string ⋮ Inferring a DNA sequence from erroneous copies ⋮ Fourier transform bounded Kolmogorov complexity ⋮ Randomness as an invariant for number representations ⋮ Comparing descriptional and computational complexity of infinite words ⋮ Towards an algorithmic theory of adaptation ⋮ Kolmogorov complexity and random graphs ⋮ A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law ⋮ Almost everywhere high nonuniform complexity ⋮ Inductive reasoning and Kolmogorov complexity ⋮ Compressibility, laws of nature, initial conditions and complexity ⋮ Average case complexity under the universal distribution equals worst- case complexity ⋮ On the power of several queues ⋮ Linear speed-up does not hold on Turing machines with tree storages ⋮ On relative randomness ⋮ Functional programs as compressed data ⋮ 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 ⋮ The problem of survival from an algorithmic point of view ⋮ Philosophical issues in Kolmogorov complexity ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Instability, complexity, and evolution ⋮ Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity ⋮ Protocols for asymmetric communication channels ⋮ Presentations of computably enumerable reals.
This page was built for publication:
