Unpredictability and Computational Irreducibility
From MaRDI portal
Publication:2929348
DOI10.1007/978-3-642-35482-3_19zbMath1298.68188arXiv1111.4121OpenAlexW1516908437MaRDI QIDQ2929348
Hervé P. Zwirn, Jean-Paul Delahaye
Publication date: 12 November 2014
Published in: Emergence, Complexity and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.4121
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Depth as randomness deficiency
- Classical recursion theory. The theory of functions and sets of natural numbers
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Algorithmic Randomness and Complexity
- Statistical mechanics of cellular automata
- From Instability to Intelligence
- Chaos in Dynamical Systems
- Effective Complexity and Its Relation to Logical Depth
- The definition of random sequences
- Computational Complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unpredictability and Computational Irreducibility
