The SCEAS System
Navigation Menu

Search the dblp DataBase


Gregory J. Chaitin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gregory J. Chaitin
    The Limits of Mathematics - Course Outline and Software (Abstract). [Citation Graph (0, 0)][DBLP]
    Analysis of Dynamical and Cognitive Systems, 1993, pp:1- [Conf]
  2. Gregory J. Chaitin
    Two Philosophical Applications of Algorithmic Information Theory. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:1-10 [Conf]
  3. Gregory J. Chaitin
    The Omega Number: Irreducible Complexity in Pure Math. [Citation Graph (0, 0)][DBLP]
    MKM, 2006, pp:1- [Conf]
  4. Gregory J. Chaitin
    Register allocation and spilling via graph coloring (with retrospective) [Citation Graph (0, 0)][DBLP]
    Best of PLDI, 1982, pp:66-74 [Conf]
  5. Gregory J. Chaitin
    Register Allocation & Spilling via Graph Coloring. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Symposium on Compiler Construction, 1982, pp:98-105 [Conf]
  6. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein
    Register Allocation Via Coloring. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1981, v:6, n:1, pp:47-57 [Journal]
  7. Gregory J. Chaitin
    A Century of Controvery Over the Foundations of Mathematics II [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  8. Gregory J. Chaitin, Asat Arslanov, Cristian Calude
    Program-size Complexity Computes the Halting Problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal]
  9. Verónica Becher, Gregory J. Chaitin
    Another Example of Higher Order Randomness. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:51, n:4, pp:325-338 [Journal]
  10. Gregory J. Chaitin
    Probability and Program-Size for Functions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:4, pp:367-370 [Journal]
  11. Gregory J. Chaitin
    Algorithmic Information Theory. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1977, v:21, n:4, pp:350-359 [Journal]
  12. Gregory J. Chaitin
    On the Length of Programs for Computing Finite Binary Sequences. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1966, v:13, n:4, pp:547-569 [Journal]
  13. Gregory J. Chaitin
    On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:145-159 [Journal]
  14. Gregory J. Chaitin
    On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:3, pp:407-422 [Journal]
  15. Gregory J. Chaitin
    Information-Theoretic Limitations of Formal Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:403-424 [Journal]
  16. Gregory J. Chaitin
    A Theory of Program Size Formally Identical to Information Theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:3, pp:329-340 [Journal]
  17. Gregory J. Chaitin
    Algorithmic Irreducibility in a Cellular Automata Universe. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:12, pp:1901-1903 [Journal]
  18. Gregory J. Chaitin
    The Limits of Mathematics. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:5, pp:270-305 [Journal]
  19. Gregory J. Chaitin
    Information-Theoretic Characterizations of Recursive Infinite Strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:1, pp:45-48 [Journal]
  20. Gregory J. Chaitin
    An Algebraic Characterization of the Halting Probability. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:1-2, pp:17-23 [Journal]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002