A formal theory of inductive inference. Part II

Cited in

(only showing first 100 items - show all)

Information dissipation in quantum-chaotic systems: Computational view and measurement induction
Research in the theory of inductive inference by GDR mathematicians - A survey
Random languages for nonuniform complexity classes
Almost everywhere high nonuniform complexity
Inductive reasoning and Kolmogorov complexity
Average case complexity under the universal distribution equals worst- case complexity
Circuit size relative to pseudorandom oracles
A mathematical theory of learning transformational grammar
Inference for regular bilanguages
Sequential fuzzy system identification
Predictive stochastic complexity and model estimation for finite-state processes
Computational depth and reducibility
On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
The discovery of algorithmic probability
PAC learning of concept classes through the boundaries of their items
Algorithmic complexity of recursive and inductive algorithms
The structural complexity of DNA templates -- implications on cellular complexity
Algorithmic complexity of quantum capacity
Open problems in universal induction \& intelligence
Obituary: Ray Solomonoff, founding father of algorithmic information theory
A complete theory of everything (will be subjective)
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
A generalized characterization of algorithmic probability
Deflating the deflationary view of information
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Symmetry of information and one-way functions
The calculi of emergence: Computation, dynamics and induction
Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
Recursive computational depth.
Algorithmic analysis of irrational rotations in a single neuron model
Data compression and learning in time sequences analysis
Complexity analysis to explore the structure of ancient stromatolites
Randomness and reducibility
The Kolmogorov complexity of random reals
A network of autoregressive processing units for time series modeling
Putnam's diagonal argument and the impossibility of a universal learning machine
A theory of incremental compression
Information and complexity, or: where is the information?
Thinking with notations: epistemic actions and epistemic activities in mathematical practice
PAC-learning gains of Turing machines over circuits and neural networks
Predictions and algorithmic statistics for infinite sequences
Induction: a logical analysis
Mathematics as information compression via the matching and unification of patterns
Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness
Descriptive complexity of computable sequences revisited
On universal prediction and Bayesian confirmation
`Ideal learning' of natural language: positive results about learning from positive evidence
Analogies and theories: the role of simplicity and the emergence of norms
On the inference of Turing machines from sample computations
Individual communication complexity
The universal path integral
Chaitin's omega and an algorithmic phase transition
Real patterns and indispensability
A note on Blum static complexity measures
Algorithmic statistics: forty years later
The quest for uncertainty
On the Kolmogorov complexity of continuous real functions
Kolmogorov complexity and probability measures.
Decision trees do not generalize to new variations
Algorithmic information theory and its statistical mechanical interpretation
A formal approach to the problem of logical non-omniscience
What is quantum information?
Degrees of monotone complexity
On the influence of technology on learning processes
An information-geometric approach to learning Bayesian network topologies from data
Quantum algorithmic complexities and entropy
Justifying additive noise model-based causal discovery via algorithmic information theory
Strict process machine complexity
Quantitative limits on the ability of a Maxwell demon to extract work from heat
Convergence rates for the minimum complexity estimator of counting process intensities^∗
Information-geometric approach to inferring causal directions
Bicompletions of distance matrices
Artificial sequences and complexity measures
Observations on computability, uncertainty, and technology
The whole and the parts: the minimum description length principle and the a-contrario framework
Universal coding and prediction on ergodic random points
Fractal dimension versus process complexity
Degrees of randomized computability
Dimension spectra of lines
A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
Identification of probabilities
An incompressibility theorem for automatic complexity
What is Shannon information?
Kolmogorov complexity in perspective. I: Information theory and randomness
Every 2-random real is Kolmogorov random
On the computability of a construction of Brownian motion
Enumerations of the Kolmogorov function
A theory of information structure I. General principles
Inductive logic programming
Learners based on transducers
Explanatory and creative alternatives to the MDL principle
Predictability: a way to characterize complexity
The evolution of human communication and the information revolution --- A mathematical perspective
Martingales in the Study of Randomness
Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
Grammar-based compression and its use in symbolic music analysis
Logical activation functions for training arbitrary probabilistic Boolean operations
Uncomputability and physical law
Introduction to SVM

This page was built for publication: A formal theory of inductive inference. Part II

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