On interpreting Chaitin's incompleteness theorem

Journal of Philosophical Logic

Volumn 27, Issue 6, 1998, Pages 569-586

  Raatikainen, Panu ^a  

^a Department of Philosophy ^*  (Finland)

Author keywords

Algorithmic information theory; Incompleteness; Kolmogorov complexity

Indexed keywords

EID: 54649084125     PISSN: 00223611     EISSN: 15730433     Source Type: Journal    
DOI: 10.1023/A:1004305315546     Document Type: Article

References (21)

1. Bar-Hillel, Y. (1964). Language and Information: Selected Essays on Their Theory and Application, Addison-Wesley and The Jerusalem Academic Press, Reading, MA and Jerusalem.
2. Boolos, G. S. and Jeffrey, R. C. (1989). Computability and Logic, third edition, Cambridge University Press, Cambridge.
3. Chaitin, G. J. (1974a). Information-theoretic computational complexity, IEEE Transactions on Information Theory IT-20, 10-15.
4. Chaitin, G. J. (1974b). Information-theoretic limitations of formal systems, J. of the ACM 21, 403-424.
5. Chaitin, G. J. (1975). Randomness and mathematical proof, Scientific American 232(5), 47-52.
6. Chaitin, G. J. (1977). Algorithmic information theory, IBM Journal of Research and Development 21, 350-359, 496.
7. Chaitin, G. J. (1982). Gödel's theorem and information, Internat. J. Theoret. Phys. 22, 941-954.
8. Davis, M. (1978). What is a computation?, in Mathematics Today (L. A. Stern, ed.), Springer-Verlag, Berlin, 241-267.
9. Delahaye, J.-P (1989). Chaitin's equation: an extension of Gödel's theorem, Notices of the A.M.S. 36(8), 984-7.
10. Kleene, S. K. (1938). On notations for ordinal numbers, J. Symbolic Logic 3, 150-155.
11. Kreisel, G. and Levy, A. (1968). Reflection principles and their uses for establishing the complexity of axiomatic systems, Z. Math. Logik Grundlag. Math. 14, 97-142.
12. van Lambalgen, M. (1989). Algorithmic information theory, J. Symbolic Logic 54, 1389-1400.
13. Odifreddi, P. (1989). Classical Recursion Theory, North-Holland, Amsterdam.
14. Quine, W. V. (1940). Mathematical Logic, W. W. Norton, New York.
15. Rogers, H. (1958). Gödel numbering of partial recursive functions, J. Symbolic Logic 23, 331-341.
16. Rogers, H. (1967). Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
17. Rucker, R. (1987). Mind Tools, Houghton Mifflin, Boston.
18. Ruelle, D. (1991). Chance and Chaos, Princeton University Press, Princeton.
19. Shoenfield, J. R. (1967). Mathematical Logic, Addison-Wesley, Reading, MA.
20. Stewart, I. (1992). The Problems of Mathematics, Oxford University Press, Oxford.
21. Tymoczko, T. (ed.) (1986). New Directions in the Philosophy of Mathematics, Birkhäuser, Boston.