Relativizing chaitin's halting probability
Journal of Mathematical Logic 5 (02):167-192 (2005)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
|
| Through your library | Configure |
Panu Raatikainen (2000). Algorithmic Information Theory and Undecidability. Synthese 123 (2):217-225.
Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn (2006). Calibrating Randomness. Bulletin of Symbolic Logic 12 (3):411-491.
Christian Calude (ed.) (2007). Randomness & Complexity, From Leibniz to Chaitin. World Scientific Pub Co Inc.
Hugues Leblanc & Peter Roeper (1989). On Relativizing Kolmogorov's Absolute Probability Functions. Notre Dame Journal of Formal Logic 30 (4):485-512.
Joel David Hamkins & Alexei Miasnikov (2006). The Halting Problem Is Decidable on a Set of Asymptotic Probability One. Notre Dame Journal of Formal Logic 47 (4):515-524.
Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2).
Michael Strevens (1999). Objective Probability as a Guide to the World. Philosophical Studies 95 (3):243-275.
Gordana Dodig-Crnkovic (2007). WHERE DO NEW IDEAS COME FROM? HOW DO THEY EMERGE? - EPISTEMOLOGY AS COMPUTATION. In Christian Calude (ed.), Randomness & Complexity, from Leibniz to Chaitin.
Richard Otte (1987). A Theistic Conception of Probability. Faith and Philosophy 4 (4):427-447.
Rod Downey, Andre Nies, Rebecca Weber & Liang Yu (2006). Lowness and Π₂⁰ Nullsets. Journal of Symbolic Logic 71 (3):1044-1052.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-09-02Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

