Re: question on algorithmic complexity

Brian D. Harper (bharper@magnus.acs.ohio-state.edu)
Thu, 18 Jan 1996 13:56:13 -0500

>BTW, I could use a pointer to relevant works by Chaitin. I think he had a
>book from MIT Press that I wanted to take a look at a while ago, but all I
>found in the GMR library was the following:
>
>AUTHOR: Chaitin, Gregory J.
>TITLE: Information-theoretic incompleteness.
>IMPRINT: Singapore ; River Edge, NJ : World Scientific Pub. Co., c1992.
>COLLATION: viii, 226 p.
>SERIES: World Scientific series in Computer Science ; vol. 35
>SUBJ: Machine theory.
> Computational complexity.
>CALLNUM: QA267 .C5
>

This reference is not too bad, but you want to skip over the first
half of it (too theoretical). The second half contains reprints
of some of Chaitin's articles.

Exceedingly better, though, is:

=================================
A collection of Chaitin's Papers:
=================================

Chaitin, G.J. (1990). <Information Randomness & Incompleteness:
Papers on Algorithmic Information Theory>, Second Edition,
World Scientific, Singapore.

[may be difficult to get; here are some of the papers in this
collection in case you can't find the book]

Chaitin, G.J. (1970). "To a Mathematical Definition of Life,"
<ACM SICACT News> 4:12-18.

Chaitin, G.J. (1975). "Randomness and Mathematical Proof,"
<Scientific American> 232(May 1975):47-52.

Chaitin, G.J. (1977). "Algorithmic Information Theory,"
<IBM Journal of Research and Development> 21:350,359,496.

Chaitin, G.J. (1979). "Toward a Mathematical Definition of
'Life'," in <The Maximum Entropy Formalism>, Editors
R.D. Levine and M. Tribus, MIT Press, pp. 477-498.

Chaitin, G.J. (1982). "Godels Theorem and Information,"
<International Journal of Theoretical Physics>, 22:941-954.

Chaitin, G.J. (1988). "Randomness in Arithmetic,"
<Scientific American> 259(July 1988):80-85.

other references:
==============================================
Algorithmic Information Theory: textbook level
==============================================

Cover, Thomas and J. A. Thomas (1991). <Elements of Information
Theory>, John Wiley and Sons.

Li,M. and P.M.B. Vitanyi (1993) <An Introduction to Kolmogorov
Complexity and Its Applications>, Springer-Verlag, New York

Yockey, H.P. (1992). <Information Theory and Molecular
Biology>, Cambridge University Press.

=========================================================
Algorithmic Information Theory: popular level discussions
=========================================================
[none of these is devoted solely to AIT, they just contain
interesting discussions of the subject, some lengthier than
others]

Casti, John L. (1990). <Searching for Certainty: What
Scientists can Know About the Future>, William Morrow
and Company, New York.

Casti, John L. (1994). <Complexification>, HarperCollins.

Coveney, P. and R. Highfield (1995). <Frontiers of Complexity>,
Fawcett Columbine, New York.

Davies, Paul (1988). <The Cosmic Blueprint: New Discoveries in
Nature's Creative Ability to Order the Universe>, Simon and
Schuster, New York.

Gell-Mann, M. (1994). <The Quark and the Jaguar>, W. H. Freeman
and Company.

Nicolis, G. and I. Prigogine (1989). <Exploring Complexity>,
W. H. Freeman and Co.
======================================================================

========================
Brian Harper |
Associate Professor | "It is not certain that all is uncertain,
Applied Mechanics | to the glory of skepticism" -- Pascal
Ohio State University |
========================