On the Length of Programs for Computing Finite Binary Sequences

Cited In (only showing first 100 items - show all)

Process and truth-table characterisations of randomness
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
Computational depth and reducibility
Genus distributions for iterated claws
Disentangling complexity from randomness and chaos
Complexity Invariance by Replication in the Quantum Square Well
On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
Sophistication revisited
Counting probability distributions: Differential geometry and model selection
Quantum Kolmogorov complexity
Development of metrics and a complexity scale for the topology of assembly supply chains
Natural halting probabilities, partial randomness, and zeta functions
Quasi-Monte Carlo methods and pseudo-random numbers
Fisher-Shannon plane and statistical complexity of atoms
Open problems in universal induction \& intelligence
Degrees of monotone complexity
A geometric approach to complexity
A theory of information structure I. General principles
Entropy and algorithmic complexity in quantum information theory
Low-depth witnesses are easy to find
Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction
Computational complementarity
Predictability: a way to characterize complexity
Quantum algorithmic complexities and entropy
A catalog of Boolean concepts.
Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
The dimensions of individual strings and sequences
Algorithmic complexity of points in dynamical systems
Impugning randomness, convincingly
Shiner–Davison–Landsberg complexity revisited
On the advice complexity of the \(k\)-server problem
On the syntactic structure of protein sequences and the concept of grammar complexity
On the notion of infinite pseudorandom sequences
QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
Almost everywhere high nonuniform complexity
Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
Arithmetical representations of Brownian motion I
Tape versus queue and stacks: The lower bounds
The discovery of algorithmic probability
APPROXIMATE, NON-DETERMINISTIC MODELLING OF BEHAVIOUR SEQUENCES
Circuit size relative to pseudorandom oracles
The descriptive complexity of Brownian motion
The Kolmogorov complexity of infinite words
A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
Algorithmic information theory and its statistical mechanical interpretation
On the advice complexity of the \(k\)-server problem
Effective entropies and data compression
Dynamics of a generic Brownian motion: Recursive aspects
Endliche Automaten und Zufallsfolgen
Kolmogorov complexity in perspective. I: Information theory and randomness
Towards an axiomatic system for Kolmogorov complexity
Enumerations of the Kolmogorov function
Some consequences of the existnce of pseudorandom generators
Statistical learning theory, model identification and system information content
Foundations of support constraint machines
Axiomatizing Kolmogorov complexity
Statistical complexity and Fisher-Shannon information measure of \(H^{+}_{2}\)
What is quantum information?
What is Shannon information?
Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
Alan Turing and the foundation of computer science
Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
Justifying additive noise model-based causal discovery via algorithmic information theory
Convergence rates for the minimum complexity estimator of counting process intensities^∗
Toward an abstract theory of data compression
Data compression and learning in time sequences analysis
Relations between varieties of kolmogorov complexities
Entropy measures vs. Kolmogorov complexity
Entropy estimation of symbol sequences
An unpredictability approach to finite-state randomness
An upward measure separation theorem
Information density, structure and entropy in equilibrium and non-equilibrium systems
Sophistication vs logical depth
Deflating the deflationary view of information
A generalized statistical complexity measure: applications to quantum systems
Stochastic complexity in learning
Not all (possibly) “random” sequences are created equal
Physical complexity of symbolic sequences
Comment on the Shiner-Davison-Landsberg measure
Approximate Entropy as an Irregularity Measure for Financial Data
Thinking with notations: epistemic actions and epistemic activities in mathematical practice
Renormalized entropy for one dimensional discrete maps: periodic and quasi-periodic route to chaos and their robustness
A comparison of Shannon, Kullback-Leibler and renormalized entropies within successive bifurcations
Sub-computable bounded pseudorandomness
On the inference of optimal descriptions
On solving hard problems by polynomial-size circuits
A comparison of two approaches to pseudorandomness
Complexity as a contrast between dynamics and phenomenology
Quantifying complexity in the minority game
Randomness on full shift spaces
Finite approximate approach to the study of the complexity of recursive predicates
Model discrimination using an algorithmic information criterion
On principles of emergent organization
Kolmogorov-Complexity Based on Infinite Computations
Information theory: A multifaceted model of information
Identifying randomness given by high descriptive complexity
Generation of symmetric exponential sums
The structural complexity of DNA templates -- implications on cellular complexity
Asymptotical behaviour of some non-uniform measures

This page was built for publication: On the Length of Programs for Computing Finite Binary Sequences

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