4 found
  1. Computational Complexity and Godel's Incompleteness Theorem.Gregory J. Chaitin - 1970 - [Rio De Janeiro, Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
  2.  27
    Goedel's Way: Exploits Into an Undecidable World.Gregory J. Chaitin - 2011 - Crc Press.
    This accessible book gives a new, detailed and elementary explanation of the Gödel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no ...
    Direct download  
    Export citation  
    Bookmark   2 citations  
  3.  11
    A Century of Controversy Over the Foundations of Mathematics.Gregory J. Chaitin - 2000 - Complexity 5 (5):12-21.
  4.  17
    How to Run Algorithmic Information Theory on a Computer:Studying the Limits of Mathematical Reasoning.Gregory J. Chaitin - 1996 - Complexity 2 (1):15-21.