Computability and information in models of randomness and chaos
From MaRDI portal
Publication:5458068
Recommendations
Cites work
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Algorithmic Information Theory
- Combinatorial foundations of information theory and the calculus of probabilities
- Orbit complexity by computable structures
- Pointwise information entropy for metric spaces
- Proof of the Ergodic Theorem
- Randomness conservation inequalities; information and independence in mathematical theories
- The definition of random sequences
Cited in
(8)- Causal nets for geometrical Gandy-Păun-Rozenberg machines
- Sporadicity: Between periodic and chaotic dynamical behaviors
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- scientific article; zbMATH DE number 4089442 (Why is no real title available?)
- Randomness and Determination, from Physics and Computing towards Biology
- The algorithmic information content for randomly perturbed systems
- Computability of entropy and information in classical Hamiltonian systems
- Algorithmic chaos and the incompressibility method
This page was built for publication: Computability and information in models of randomness and chaos
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458068)
