On the Length of Programs for Computing Finite Binary Sequences

Cited in

(only showing first 100 items - show all)

Enumerations of the Kolmogorov function
Statistical complexity and Fisher-Shannon information measure of \(H^{+}_{2}\)
What is quantum information?
Statistical learning theory, model identification and system information content
Axiomatizing Kolmogorov complexity
Foundations of support constraint machines
Computational depth and reducibility
Quantum information distance
Minimum message length encoding and the comparison of macromolecules
What is Shannon information?
Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
One-way functions using algorithmic and classical information theories
Observations on the generation of permutations from random sequences
Alan Turing and the foundation of computer science
Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
On measuring the complexity of networks: Kolmogorov complexity versus entropy
The representation and manipulation of the algorithmic probability measure for problem solving.
Complexity study of \(q\)-deformed quantum harmonic oscillator
Justifying additive noise model-based causal discovery via algorithmic information theory
LISP program-size complexity
LISP program-size complexity. III
Convergence rates for the minimum complexity estimator of counting process intensities^∗
Toward an abstract theory of data compression
Simplicity and likelihood: an axiomatic approach
On graph entropy measures based on the number of independent sets and matchings
Real patterns and indispensability
Data compression and learning in time sequences analysis
Entropy measures vs. Kolmogorov complexity
Observations on computability, uncertainty, and technology
Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random \(k\)-SAT
Minimal-program complexity of pseudo-recursive and pseudo-random sequences
Relations between varieties of kolmogorov complexities
Sets with small generalized Kolmogorov complexity
An unpredictability approach to finite-state randomness
An upward measure separation theorem
Subrecursive programming languages. II. On program size
Entropy estimation of symbol sequences
Information and complexity, or: where is the information?
Sophistication vs logical depth
Deflating the deflationary view of information
Information density, structure and entropy in equilibrium and non-equilibrium systems
Stochastic complexity in learning
A generalized statistical complexity measure: applications to quantum systems
THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
Uncomputability and physical law
Kolmogorov complexity and probability measures.
Not all (possibly) “random” sequences are created equal
A network of autoregressive processing units for time series modeling
Physical complexity of symbolic sequences
Configuration complexity assessment of convergent supply chain systems
Artificial sequences and complexity measures
Process and truth-table characterisations of randomness
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
A comparison of Shannon, Kullback-Leibler and renormalized entropies within successive bifurcations
On the inference of optimal descriptions
Recursively enumerable reals and Chaitin \(\Omega\) numbers
On solving hard problems by polynomial-size circuits
Renormalized entropy for one dimensional discrete maps: periodic and quasi-periodic route to chaos and their robustness
A comparison of two approaches to pseudorandomness
Quantifying complexity in the minority game
Complexity as a contrast between dynamics and phenomenology
Sub-computable bounded pseudorandomness
Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
Genus distributions for iterated claws
Disentangling complexity from randomness and chaos
Computational depth and reducibility
On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
Finite approximate approach to the study of the complexity of recursive predicates
Model discrimination using an algorithmic information criterion
Randomness on full shift spaces
Complexity Invariance by Replication in the Quantum Square Well
Sophistication revisited
Information theory: A multifaceted model of information
Kolmogorov-Complexity Based on Infinite Computations
On principles of emergent organization
Identifying randomness given by high descriptive complexity
Development of metrics and a complexity scale for the topology of assembly supply chains
Counting probability distributions: Differential geometry and model selection
Generation of symmetric exponential sums
Natural halting probabilities, partial randomness, and zeta functions
The structural complexity of DNA templates -- implications on cellular complexity
Quantum Kolmogorov complexity
Asymptotical behaviour of some non-uniform measures
Quasi-Monte Carlo methods and pseudo-random numbers
Fisher-Shannon plane and statistical complexity of atoms
Nonuniform complexity and the randomness of certain complete languages
Regression Estimation from an Individual Stable Sequence
Martingales in the Study of Randomness
Open problems in universal induction \& intelligence
Grammar-based compression and its use in symbolic music analysis
A theory of information structure I. General principles
Degrees of monotone complexity
Algorithmic complexity of recursive and inductive algorithms
Cryptography and algorithmic randomness
Eine Bemerkung zum Begriff der zuf�lligen Folge
Information dissipation in quantum-chaotic systems: Computational view and measurement induction
Automaton introspection
Entropy and algorithmic complexity in quantum information theory

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)