default search action
Gregory J. Chaitin
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j29]Gregory J. Chaitin:
A Visitor from Buenos Aires in the United States. Bull. EATCS 135 (2021)
2010 – 2019
- 2012
- [c8]Gregory J. Chaitin:
How Much Information Can There Be in a Real Number? Computation, Physics and Beyond 2012: 247-251
2000 – 2009
- 2009
- [j28]Gregory J. Chaitin:
Evolution of Mutating Software. Bull. EATCS 97: 157-164 (2009) - 2008
- [j27]Gregory J. Chaitin:
The Halting Probability via Wang Tiles. Fundam. Informaticae 86(4): 429-433 (2008) - 2007
- [b6]Gregory J. Chaitin:
Thinking about Gödel and Turing - Essays on Complexity, 1970 - 2007. World Scientific 2007, ISBN 978-981-270-895-3, pp. I-XIX, 1-345 - [j26]Gregory J. Chaitin:
Speculations on Biology, Information and Complexity. Bull. EATCS 91: 231-237 (2007) - [j25]Gregory J. Chaitin:
An Algebraic Characterization of the Halting Probability. Fundam. Informaticae 79(1-2): 17-23 (2007) - [j24]Gregory J. Chaitin:
How Much Information Can There be in a Real Number? Int. J. Bifurc. Chaos 17(6): 1933-1935 (2007) - 2006
- [j23]Gregory J. Chaitin:
Probability and Program-Size for Functions. Fundam. Informaticae 71(4): 367-370 (2006) - [j22]Gregory J. Chaitin:
How Real are Real Numbers? Int. J. Bifurc. Chaos 16(6): 1841-1848 (2006) - [c7]Gregory J. Chaitin:
The Omega Number: Irreducible Complexity in Pure Math. MKM 2006: 1 - 2005
- [j21]Gregory J. Chaitin:
Algorithmic Irreducibility in a Cellular Automata Universe. J. Univers. Comput. Sci. 11(12): 1901-1903 (2005) - 2003
- [c6]Gregory J. Chaitin:
Two Philosophical Applications of Algorithmic Information Theory. DMTCS 2003: 1-10 - 2002
- [b5]Gregory J. Chaitin:
Conversations with a mathematician - math, art, science and the limits of reason. Springer 2002, ISBN 978-1-85233-549-6, pp. I-VII, 1-158 - [b4]Gregory J. Chaitin:
Exploring RANDOMNESS. Discrete mathematics and theoretical computer science, Springer 2002, ISBN 978-1-85233-417-8, pp. I-X, 1-164 - [j20]Gregory J. Chaitin:
Paradoxes of randomness and the limitations of mathematical reasoning. Complex. 7(5): 14-21 (2002) - [j19]Verónica Becher, Gregory J. Chaitin:
Another Example of Higher Order Randomness. Fundam. Informaticae 51(4): 325-338 (2002) - 2001
- [c5]Verónica Becher
, Sergio Daicz, Gregory J. Chaitin:
A Highly Random Number. DMTCS 2001: 55-68 - 2000
- [j18]Gregory J. Chaitin:
A century of controversy over the foundations of mathematics. Complex. 5(5): 12-21 (2000) - [p1]Gregory J. Chaitin:
A Century of Controversy over the Foundations of Mathematics. Finite Versus Infinite 2000: 75-100 - [i1]Gregory J. Chaitin:
A Century of Controvery Over the Foundations of Mathematics II. CoRR nlin.CD/0004007 (2000)
1990 – 1999
- 1996
- [j17]Gregory J. Chaitin:
A new version of algorithmic information theory. Complex. 1(4): 55-59 (1996) - [j16]Gregory J. Chaitin:
How to run algorithmic information theory on a computer: Studying the limits of mathematical reasoning. Complex. 2(1): 15-21 (1996) - [j15]Gregory J. Chaitin:
The Limits of Mathematics. J. Univers. Comput. Sci. 2(5): 270-305 (1996) - [c4]Gregory J. Chaitin:
An Invitation to Algorithmic Information Theory. DMTCS 1996: 1-23 - 1995
- [j14]Gregory J. Chaitin:
The Berry paradox. Complex. 1(1): 26-30 (1995) - [j13]Gregory J. Chaitin, Asat Arslanov, Cristian Calude:
Program-size Complexity Computes the Halting Problem. Bull. EATCS 57 (1995) - 1993
- [c3]Gregory J. Chaitin:
The Limits of Mathematics - Course Outline and Software (Abstract). Analysis of Dynamical and Cognitive Systems 1993: 1 - 1992
- [b3]Gregory J. Chaitin:
Information-Theoretic Incompleteness. World Scientific Series in Computer Science 35, World Scientific 1992, ISBN 978-981-02-1208-7, pp. 1-238 - 1990
- [b2]Gregory J. Chaitin:
Information, Randomness and Incompleteness - Papers on Algorithmic Information Theory; 2nd Edition. World Scientific Series in Computer Science 8, World Scientific 1990, ISBN 978-981-02-0154-8, pp. 1-324
1980 – 1989
- 1987
- [b1]Gregory J. Chaitin:
Algorithmic information theory. Cambridge tracts in theoretical computer science 1, Cambridge University Press 1987, ISBN 978-0-521-34306-0, pp. I-VIII, 1-178 - 1982
- [c2]Gregory J. Chaitin:
Register allocation and spilling via graph coloring (with retrospective). Best of PLDI 1982: 66-74 - [c1]Gregory J. Chaitin:
Register Allocation & Spilling via Graph Coloring. SIGPLAN Symposium on Compiler Construction 1982: 98-105 - 1981
- [j12]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)
1970 – 1979
- 1977
- [j11]Gregory J. Chaitin:
Algorithmic Information Theory. IBM J. Res. Dev. 21(4): 350-359 (1977) - 1976
- [j10]Gregory J. Chaitin:
Information-Theoretic Characterizations of Recursive Infinite Strings. Theor. Comput. Sci. 2(1): 45-48 (1976) - 1975
- [j9]Gregory J. Chaitin:
A Theory of Program Size Formally Identical to Information Theory. J. ACM 22(3): 329-340 (1975) - 1974
- [j8]Gregory J. Chaitin:
Information-Theoretic Limitations of Formal Systems. J. ACM 21(3): 403-424 (1974) - [j7]Gregory J. Chaitin:
Information-theoretic computation complexity. IEEE Trans. Inf. Theory 20(1): 10-15 (1974) - 1973
- [j6]Gregory J. Chaitin:
Some philosophical implications of information-theoretic computational complexity. SIGACT News 5(2): 21-23 (1973) - 1970
- [j5]Gregory J. Chaitin:
On the difficulty of computations. IEEE Trans. Inf. Theory 16(1): 5-9 (1970)
1960 – 1969
- 1969
- [j4]Gregory J. Chaitin:
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. J. ACM 16(1): 145-159 (1969) - [j3]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
- [j2]Gregory J. Chaitin:
On the Length of Programs for Computing Finite Binary Sequences. J. ACM 13(4): 547-569 (1966) - 1965
- [j1]Gregory J. Chaitin:
An Improvement on a Theorem of E. F. Moore. IEEE Trans. Electron. Comput. 14(3): 466-467 (1965)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: