• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Physical Sciences and Engineering Mathematics Logic

Some theorems on the algorithmic approach to probability theory and information theory

Article ID Journal Published Year Pages File Type
4662074 Annals of Pure and Applied Logic 2010 12 Pages PDF
Keywords
03D3268Q3060A0594A15EntropyInformationAlgorithmRandomnessKolmogorov complexity
Related Topics
Physical Sciences and Engineering Mathematics Logic
Preview
Some theorems on the algorithmic approach to probability theory and information theory
Authors
Leonid A. Levin,
Related Articles
Products of Menger spaces: A combinatorial approach
A classification of orbits admitting a unique invariant measure
Cardinal characteristics at κ   in a small u(κ)u(κ) model
Bounded stationary reflection II
Labeled sequent calculus for justification logics
Effective results on a fixed point algorithm for families of nonlinear mappings
Vaught's conjecture for quite o-minimal theories
Proof complexity of intuitionistic implicational formulas
Pseudo real closed fields, pseudo p-adically closed fields and NTP2
Essential and density topologies of continuous domains
Journal
Annals of Pure and Applied Logic
Journal: Annals of Pure and Applied Logic
Related Categories
03D32
68Q30
60A05
94A15
Entropy
Information
Algorithm
Randomness
Kolmogorov complexity
Algebra and Number Theory
Analysis
Applied Mathematics
Computational Mathematics
Control and Optimization
Discrete Mathematics and Combinatorics
Geometry and Topology
Logic
Mathematical Physics
Mathematics (General)
Modelling and Simulation
Numerical Analysis
Statistics and Probability
Theoretical Computer Science
Related Journals
Journal of Applied Logic
Daneshyari provides fulltext access to millions of research papers.