Register | Log in | FAQ      [?] 

Author Chaitin [26 articles]

Recent papers posted to CiteULike by the author Chaitin.
  • Register allocation & spilling via graph coloring
    Vol. 17, No. 6. (June 1982), pp. 98-101.
    by GJ Chaitin
    posted to register-allocation compiler by sby on 2008-06-27 03:23:35 as *****
  • How real are real numbers?
    (24 November 2004)
    by GJ Chaitin
    posted to models_of_computation maths by jimburton on 2008-06-17 16:30:26 as ** along with 12 people and 2 groups watson SamB sourada mafwood A_Olympia DineshGaitonde jrw ChaTo xtizon proportional BrendaChng scis0000001 Philosophy_of_Information Blog_and_Wiki_Research
  • Responses to “Theoretical Mathematics: Toward a cultural synthesis of mathematics and theoretical physics”, by A. Jaffe and F. Quinn
    (1 Apr 1994)
    by Michael Atiyah, Armand Borel, GJ Chaitin, Daniel Friedan, James Glimm, Jeremy J Gray, Morris W Hirsch, Saunder Maclane, Benoit B Mandelbrot, David Ruelle, Albert Schwarz, Karen Uhlenbeck, René Thom, Edward Witten, Christopher Zeeman
    posted to general-culture by dmitri83 on 2008-04-07 05:00:21 as ** along with 1 person NitinCR
  • Information-theoretic computation complexity
    Information Theory, IEEE Transactions on, Vol. 20, No. 1. (1974), pp. 10-15.
    by G Chaitin
    posted to complexity by teesid on 2007-12-18 10:21:48 as **** along with 1 person BarrosH
  • A Theory of Program Size Formally Identical to Information Theory
    J. ACM, Vol. 22, No. 3. (July 1975), pp. 329-340.
    by Gregory J Chaitin
    posted to complexity comute information program shortest size theory to by apperson on 2007-10-31 17:42:56 as read along with 1 person and 1 group jack Vision
  • notes Responses to “Theoretical Mathematics: Toward a cultural synthesis of mathematics and theoretical physics”, by A. Jaffe and F. Quinn
    (1 Apr 1994)
    by Michael Atiyah, Armand Borel, GJ Chaitin, Daniel Friedan, James Glimm, Jeremy J Gray, Morris W Hirsch, Saunder Maclane, Benoit B Mandelbrot, David Ruelle, Albert Schwarz, Karen Uhlenbeck, René Thom, Edward Witten, Christopher Zeeman
    posted to popular by archernikov on 2007-06-20 14:12:43 as read along with 3 people ansobol jrw proportional
  • How real are real numbers?
    (29 Nov 2004)
    by GJ Chaitin
    posted to foundations numbers real by ujarmatokyaniv on 2007-06-16 01:11:51 as **** along with 1 person scis0000001
  • Information, Randomness and Incompleteness: Papers on Algorithmic Information Theory (World Scientific Series in Computer Science, Vol 8)
    (16 March 1988)
    by Gregory J Chaitin
    posted to compsci informationtheory mathematics teachmyself by livingthingdan on 2007-05-17 14:11:18 as **** along with 1 group livingthing
  • The intelligibility of the universe and the notions of simplicity, complexity and irreducibility
    (2002)
    by G Chaitin
    posted to compsci hps informationtheory modelling parsimony teachmyself by livingthingdan on 2007-05-17 14:05:46 as **** along with 1 person and 1 group sdvillal livingthing
  • Algorithmic information theory
    (1987)
    by Gregory J Chaitin
    posted to complexity compsci evolution genetic parsimony teachmyself by livingthingdan on 2007-05-17 12:23:44 as ***** along with 1 group livingthing
  • Algorithmic Information Theory, IBM Journal of Research and Development, 1977
    (1987)
    by Chaitin
    posted to information-theory by calvins on 2007-02-07 22:20:55 as ***
  • Two philosophical applications of algorithmic information theory
    (27 Feb 2003)
    by GJ Chaitin
    posted to algorithmic-information-theory philosophy by scis0000001 on 2006-10-13 10:10:15 as **
  • The Berry paradox
    Complexity, Vol. 1 (1995), pp. ?-?.
    by GJ Chaitin
    posted to godel number by pile on 2006-10-10 10:34:19 as **
  • Information-Theoretic Limitations of Formal Systems, Journal of the ACM, 1974
    (1987)
    by Chaitin
    posted to algorithmic-information-theory formal-system formalization incompleteness by scis0000001 on 2006-08-29 15:15:17 as **
  • Thoughts on the Riemann hypothesis
    (22 Sep 2003)
    by GJ Chaitin
    posted to riemann_hypothesis by NitinCR on 2006-07-18 18:30:50 as **
  • The Unknowable (Discrete Mathematics and Theoretical Computer Science)
    (05 August 1999)
    by Gregory J Chaitin
    posted to computability incompleteness by spirit_of_numenor on 2006-04-30 20:18:50 as *** along with 1 group ComplexAdaptiveSystems
  • Exploring RANDOMNESS
    (07 December 2001)
    by Gregory J Chaitin
    posted to algorithmic-information-theory computability incompleteness by spirit_of_numenor on 2006-04-30 20:18:02 as **** along with 1 group ComplexAdaptiveSystems
  • The Limits of Mathematics : A Course on Information Theory and the Limits of Formal Reasoning (Discrete Mathematics and Theoretical Computer Science)
    (28 October 2002)
    by Gregory J Chaitin
    posted to computability incompleteness by spirit_of_numenor on 2006-04-30 20:16:38 as ** along with 1 group ComplexAdaptiveSystems
  • Irreducible Complexity in Pure Mathematics
    (4 Nov 2004)
    by GJ Chaitin
    posted to algorithm math by rahul on 2005-10-05 07:52:39 as ** along with 2 people and 1 group jrw ChaTo SRL
  • A New Version of Algorithmic Information Theory
    (5 Jun 1995)
    by GJ Chaitin
    posted to algorithms fun mathematics by jrw on 2005-09-26 20:35:43 as **
  • notes Leibniz, Information, Math and Physics
    (21 Jun 2003)
    by GJ Chaitin
    posted to math phylosophy by ChaTo on 2005-09-22 14:16:39 as read
  • Two philosophical applications of algorithmic information theory
    (27 Feb 2003)
    by GJ Chaitin
    posted to computation fun mathematics by jrw on 2005-09-15 20:32:34 as ** along with 1 person ChaTo
  • On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility
    (2 Oct 2002)
    by GJ Chaitin
    posted to computation fun mathematics by jrw on 2005-09-15 20:31:17 as ** along with 1 person ChaTo
  • Meta Math! : The Quest for Omega
    (04 October 2005)
    by Gregory Chaitin
    posted to math phylosophy by ChaTo on 2005-09-15 17:50:18 as ***
  • notes Paradoxes of Randomness
    ArXiv Mathematics e-prints (August 2001)
    by GJ Chaitin
    posted to math phylosophy by ChaTo on 2005-09-15 17:46:53 as read
  • On the Length of Programs for Computing Finite Binary Sequences
    J. ACM, Vol. 13, No. 4. (October 1966), pp. 547-569.
    by GJ Chaitin
    posted to phy250 sta232c by jack on 2005-06-11 06:40:06 as ** along with 1 group Vision
    • Note: You may cite this page as: http://www.citeulike.org/author/Chaitin

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.