Citations of work:

Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem.

Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  16
    On Explicating the Concept the Power of an Arithmetical Theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.
    In this paper I discuss possible ways of measuring the power of arithmetical theories, and the possiblity of making an explication in Carnap's sense of this concept. Chaitin formulates several suggestions how to construct measures, and these suggestions are reviewed together with some new and old critical arguments. I also briefly review a measure I have designed together with some shortcomings of this measure. The conclusion of the paper is that it is not possible to formulate an explication of the (...)
    Direct download (5 more)  
    Export citation  
    My bibliography   1 citation