scientific article; zbMATH DE number 1548484
From MaRDI portal
Publication:4522700
zbMATH Open0963.68084MaRDI QIDQ4522700FDOQ4522700
Authors: Gregory J. Chaitin 
Publication date: 3 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (11)
- Unpredictability and computational irreducibility
- Process physics: Inertia, gravity and the quantum
- On explicating the concept `the power of an arithmetical theory'
- Kurt Gödel's Anticipation of the Turing Machine: A Vitalistic Approach
- A frequentist interpretation of probability for model-based inductive inference
- Computing a Glimpse of Randomness
- Randomness relative to Cantor expansions
- A topological characterization of random sequences
- Exploring the randomness of mentally generated head–tail sequences
- Differences of halting probabilities
- Computational universes
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 Q4522700)
