On the Length of Programs for Computing Finite Binary Sequences
From MaRDI portal
Publication:5541327
Cited in
(only showing first 100 items - show all)- 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
- A geometric approach to complexity
- Low-depth witnesses are easy to find
- Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction
- Dimension spectra of lines
- Computational complementarity
- A catalog of Boolean concepts.
- Predictability: a way to characterize complexity
- Impugning randomness, convincingly
- Quantum algorithmic complexities and entropy
- The dimensions of individual strings and sequences
- Hierarchical approach to complexity with applications to dynamical systems
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- On the advice complexity of the \(k\)-server problem
- Algorithmic complexity of points in dynamical systems
- On the syntactic structure of protein sequences and the concept of grammar complexity
- Shiner–Davison–Landsberg complexity revisited
- Complexity of algorithms and computations
- On the notion of infinite pseudorandom sequences
- Algorithmic complexity of quantum capacity
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- Almost everywhere high nonuniform complexity
- A note on Blum static complexity measures
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- Tape versus queue and stacks: The lower bounds
- Theory construction in psychology: The interpretation and integration of psychological data
- The discovery of algorithmic probability
- Infotropism as the underlying principle of perceptual organization
- Circuit size relative to pseudorandom oracles
- Arithmetical representations of Brownian motion I
- APPROXIMATE, NON-DETERMINISTIC MODELLING OF BEHAVIOUR SEQUENCES
- The descriptive complexity of Brownian motion
- The Kolmogorov complexity of infinite words
- Effective entropies and data compression
- Algorithmic complexity as a criterion of unsolvability
- On the advice complexity of the \(k\)-server problem
- Algorithmic information theory and its statistical mechanical interpretation
- Algorithmic complexity of real financial markets
- A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
- Dynamics of a generic Brownian motion: Recursive aspects
- Endliche Automaten und Zufallsfolgen
- A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
- Relations between information criteria for model-structure selection Part 2. Modelling by shortest data description
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Towards an axiomatic system for Kolmogorov complexity
- Some consequences of the existnce of pseudorandom generators
- Random languages for nonuniform complexity classes
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)