Algorithmic information theory and undecidability

Synthese

Volumn 123, Issue 2, 2000, Pages 217-225

  Raatikainen, Panu ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3843116366     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1023/A:1005298819345     Document Type: Article

References (31)

1. Chaitin, Gregory J.: 1974a, 'Information-Theoretic Computational Complexity', IEEE Transactions on Information Theory IT-20, pp. 10-15.
2. Chaitin, Gregory J.: 1974b, 'Information-Theoretic Limitations of Formal Systems', Journal of the ACM 21, 403-424.
3. Chaitin, Gregory J.: 1975a, 'Randomness and Mathematical Proof, Scientific American 232(5), 47-52.
4. Chaitin, Gregory J.: 1975b, 'A Theory of Program Size Formally Identical to Information Theory', Journal of the ACM 22, 329-340.
5. Chaitin, Gregory J.: 1986, 'Randomness and Gödel's Theorem', Mondes en Developpement, 54-55, 125-128.
6. Chaitin, Gregory J.: 1987a, 'Incompleteness Theorem for Random Reals', Advances in Applied Mathematics 8, 119-146.
7. Chaitin, Gregory J.: 1987b, Algorithmic Information Theory, Cambridge University Press, Cambridge.
8. Chaitin, Gregory J.: 1988, 'Randomness in Arithmetic', Scientific American 259(1), 80-85.
9. Chaitin, Gregory J.: 1989, 'Undecidability and Randomness in Pure Mathematics', (a transcript of a lecture delivered 28 September 1989 at SOLVAY conference in Brussels) published in G. J. Chaitin: Information, Randomness & Incompleteness, 2nd edn., World Scientific, 1990, pp. 307-313.
10. Chaitin, Gregory J.: 1990, 'A Random Walk in Arithmetic', New Scientists 24, 44-46.
11. Chaitin, Gregory J.: 1992, 'Information-Theoretic Incompleteness', Applied Mathematics and Computation 52, 83-101.
12. Chaitin, Gregory J.: 1993, 'Randomness in Arithmetic and the Decline and Fall of Reductionism in Pure Mathematics', EATCS Bulletin, No. 50 (June 1993), pp. 314-328.
13. Reprinted in G. Chaitin: The Limits of Mathematics, Springer, Singapore, 1998, pp. 1-27.
14. Delahaye, Jean-Paul: 1989, 'Chaitin's Equation: an Extension of Gödel's Theorem', Notices of the A.M.S. 36(8), 984-987.
15. Gardner, Martin: 1979, 'Mathematical Games: the Random Number Omega Bids Fair to Hold the Mysteries of the Universe', Scientific American 241(5), 20-43.
16. Harrington, L. A., M. D. Morley, A. Scederov and S. G. Simpson (eds): 1985, Harvey Friedman's Research on the Foundations of Mathematics, North-Holland, Amsterdam.
17. Kleene, Stephen C.: 1986, 'Introductory Note to 1930b, 1931 and 1932b', in S. Feferman et al. (eds), Kurt Gödel: Collected Works, Vol. 1, Oxford University Press, 1986, pp. 126-141.
18. Kreisel, Georg: 1980, 'Kurt Gödel', Biographical Memoirs of Fellows of the Royal Society 26, 149-224.
19. Kreisel, Georg and Azriel Levy: 1968, 'Reflection Principles and their Uses for Establishing the Complexity of Axiomatic Systems', Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 14, 97-142.
20. Li, Ming and Paul Vitanyi: 1993, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York.
21. van Lambalgen, Michiel: 1989, 'Algorithmic Information Theory', Journal of Symbolic Logic 54, 1389-1400.
22. Mostowski, Andrzej: 1952, Sentences Undecidable in Formalized Arithmetic - An Exposition of the Theory of Kurt Gödel, North-Holland, Amsterdam.
23. Odifreddi, Piergiorio: 1989, Classical Recursion Theory, North-Holland, Amsterdam.
24. Paris, Jeff and Leo Harrington: 1977, 'A Mathematical Incompleteness in Peano Arithmetic', in J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, pp. 1133-1142.
25. Post, Emil: 1948, 'Degrees of Recursive Unsolvability', Bulletin of the A.M.S. 54, 641-42.
26. Putnam, Hilary: 1965, 'Trial and Error Predicates and the Solution to a Problem of Mostowski', Journal of Symbolic Logic 30, 49-57.
27. Raatikainen, Panu: 1998, 'On Interpreting Chaitin's Incompleteness Theorem', Journal of Philosophical Logic 27, 569-86.
28. Rogers, Hartley Jr.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
29. Rosser, J. Barkley: 1937, 'Gödel's Theorems for Non-Constructive Logics', Journal of Symbolic Logic 2, 129-137.
30. Stewart, Ian: 1988, 'The Ultimate in Undecidability', Nature 332, 115-16.
31. Tarski, Alfred: 1933/1956, 'The Concept of Truth in Formalized Languages', in Logic, Semantics, Metamathematics, edited and translated by J. H. Woodger, Oxford University Press, Oxford.