Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2008 | |
---|---|---|

23 | EE | Gregory J. Chaitin: The Halting Probability via Wang Tiles. Fundam. Inform. 86(4): 429-433 (2008) |

2007 | ||

22 | EE | Gregory J. Chaitin: An Algebraic Characterization of the Halting Probability. Fundam. Inform. 79(1-2): 17-23 (2007) |

21 | EE | Gregory J. Chaitin: How Much Information Can There be in a Real Number? I. J. Bifurcation and Chaos 17(6): 1933-1935 (2007) |

2006 | ||

20 | EE | Gregory J. Chaitin: The Omega Number: Irreducible Complexity in Pure Math. MKM 2006: 1 |

19 | EE | Gregory J. Chaitin: Probability and Program-Size for Functions. Fundam. Inform. 71(4): 367-370 (2006) |

18 | EE | Gregory J. Chaitin: How Real are Real Numbers? I. J. Bifurcation and Chaos 16(6): 1841-1848 (2006) |

2005 | ||

17 | EE | Gregory J. Chaitin: Algorithmic Irreducibility in a Cellular Automata Universe. J. UCS 11(12): 1901-1903 (2005) |

2003 | ||

16 | EE | Gregory J. Chaitin: Two Philosophical Applications of Algorithmic Information Theory. DMTCS 2003: 1-10 |

2002 | ||

15 | EE | Verónica Becher, Gregory J. Chaitin: Another Example of Higher Order Randomness. Fundam. Inform. 51(4): 325-338 (2002) |

2000 | ||

14 | EE | Gregory J. Chaitin: A Century of Controvery Over the Foundations of Mathematics II CoRR nlin.CD/0004007: (2000) |

1996 | ||

13 | Gregory J. Chaitin: The Limits of Mathematics. J. UCS 2(5): 270-305 (1996) | |

1995 | ||

12 | Gregory J. Chaitin, Asat Arslanov, Cristian Calude: Program-size Complexity Computes the Halting Problem. Bulletin of the EATCS 57: (1995) | |

1993 | ||

11 | Gregory J. Chaitin: The Limits of Mathematics - Course Outline and Software (Abstract). Analysis of Dynamical and Cognitive Systems 1993: 1 | |

1982 | ||

10 | EE | Gregory J. Chaitin: Register allocation and spilling via graph coloring (with retrospective) Best of PLDI 1982: 66-74 |

9 | EE | Gregory J. Chaitin: Register Allocation & Spilling via Graph Coloring. SIGPLAN Symposium on Compiler Construction 1982: 98-105 |

1981 | ||

8 | Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein: Register Allocation Via Coloring. Comput. Lang. 6(1): 47-57 (1981) | |

1977 | ||

7 | Gregory J. Chaitin: Algorithmic Information Theory. IBM Journal of Research and Development 21(4): 350-359 (1977) | |

1976 | ||

6 | Gregory J. Chaitin: Information-Theoretic Characterizations of Recursive Infinite Strings. Theor. Comput. Sci. 2(1): 45-48 (1976) | |

1975 | ||

5 | EE | Gregory J. Chaitin: A Theory of Program Size Formally Identical to Information Theory. J. ACM 22(3): 329-340 (1975) |

1974 | ||

4 | EE | Gregory J. Chaitin: Information-Theoretic Limitations of Formal Systems. J. ACM 21(3): 403-424 (1974) |

1969 | ||

3 | EE | Gregory J. Chaitin: On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. J. ACM 16(1): 145-159 (1969) |

2 | EE | Gregory J. Chaitin: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. J. ACM 16(3): 407-422 (1969) |

1966 | ||

1 | EE | Gregory J. Chaitin: On the Length of Programs for Computing Finite Binary Sequences. J. ACM 13(4): 547-569 (1966) |

1 | Asat Arslanov | [12] |

2 | Marc A. Auslander | [8] |

3 | Verónica Becher | [15] |

4 | Cristian S. Calude (Cristian Calude) | [12] |

5 | Ashok K. Chandra | [8] |

6 | John Cocke | [8] |

7 | Martin E. Hopkins | [8] |

8 | Peter W. Markstein | [8] |