scientific article; zbMATH DE number 107774
From MaRDI portal
Publication:4023358
algorithmic information theoryfoundations of statistical methods in physicsinductive reasoningKolmogorov complexity
Probability and inductive logic (03B48) Axioms; other general questions in probability (60A05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of equilibrium statistical mechanics (82B03) Measures of information, entropy (94A17)
Recommendations
Cited in
(only showing first 100 items - show all)- Effective dimension of points visited by Brownian motion
- Prescribed learning of r.e. classes
- Effective generation of subjectively random binary sequences
- Stationary algorithmic probability
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- An improved zero-one law for algorithmically random sequences
- Transforming a single-valued transducer into a Mealy machine
- A game of prediction with expert advice
- Succinct representation, leaf languages, and projection reductions
- The miraculous universal distribution
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
- Ergodic theorems for individual random sequences
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Optimal representation in average using Kolmogorov complexity
- Kolmogorov complexity arguments in combinatorics
- On reductions of NP sets to sparse sets
- Computational depth and reducibility
- On resource-bounded instance complexity
- An excursion to the Kolmogorov random strings
- The discovery of algorithmic probability
- Learning recursive functions from approximations
- Randnomness, computability, and algebraic specifications
- A strange application of Kolmogorov complexity
- The Kolmogorov expressive power of Boolean query languages
- Transformations that preserve malignness of universal distributions
- Predicting a binary sequence almost as well as the optimal biased coin
- An oracle builder's toolkit
- Languages for gestalts of line patterns.
- On hard instances
- A survey on interval routing
- On the complexity of multi-dimensional interval routing schemes
- The descriptive complexity of Brownian motion
- On the complexity of additive clustering models
- Kolmogorov random graphs only have trivial stable colorings.
- The Kolmogorov complexity of real numbers.
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
- Dimension 1 sequences are close to randoms
- Exact constructive and computable dimensions
- On two-way communication in cellular automata with a fixed number of cells
- Models of knowing and the investigation of dynamical systems
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
- The impact of information on broadcasting time in linear radio networks.
- Malign distributions for average case circuit complexity.
- The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
- On Kurtz randomness
- The Kolmogorov complexity of random reals
- Summarizing categorical data by clustering attributes
- Axiomatizing Kolmogorov complexity
- Using ideas of Kolmogorov complexity for studying biological texts
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Complexity, randomness, discretization: some remarks on a program of J. Ford
- Measures of statistical complexity: why?
- The frequency interpretation in probability
- Randomness is inherently imprecise
- Predictions and algorithmic statistics for infinite sequences
- On approximate uncomputability of the Kolmogorov complexity function
- Joint string complexity for Markov sources: small data matters
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Polylog depth, highness and lowness for E
- On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
- Exact complexity: the spectral decomposition of intrinsic computation
- Kolmogorov complexity of enumerating finite sets
- Lower bound technique for length-reducing automata
- Kolmogorov-Loveland stochasticity for finite strings
- On explicating the concept `the power of an arithmetical theory'
- Dynamics of a generic Brownian motion: Recursive aspects
- What can be efficiently reduced to the Kolmogorov-random strings?
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Chaitin's omega and an algorithmic phase transition
- Why Kolmogorov complexity?
- Around Kolmogorov complexity: basic notions and results
- A hierarchy of fast reversible Turing machines
- Two Problems for Sophistication
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity
- Renormalisation and computation. II: Time cut-off and the halting problem
- PACS, simple-PAC and query learning
- Kolmogorov complexity as a language
- Sub-classes of the monoid of left cancellative languages
- On reversible Turing machines and their function universality
- Two-party Watson-Crick computations
- Towards an axiomatic system for Kolmogorov complexity
- Predictive rate-distortion for infinite-order Markov processes
- Probabilities from entanglement, Born's rule \(p_k=| \psi_k| ^2\) from envariance
- Kolmogorov complexity and probability measures.
- Metaphysics, metamathematics and metabiology
- scientific article; zbMATH DE number 3860059 (Why is no real title available?)
- A formal approach to the problem of logical non-omniscience
- DNA sequencing and string learning
- On initial segment complexity and degrees of randomness
- Prescribed Learning of R.E. Classes
- High end complexity
- Schnorr trivial sets and truth-table reducibility
- Kolmogorov-Complexity Based on Infinite Computations
- scientific article; zbMATH DE number 4086981 (Why is no real title available?)
- scientific article; zbMATH DE number 107775 (Why is no real title available?)
- scientific article; zbMATH DE number 176218 (Why is no real title available?)
- Krimp: mining itemsets that compress
- The Smyth Completion
- scientific article; zbMATH DE number 1236371 (Why is no real title available?)
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 Q4023358)
