Skip to main content
SpringerLink
Log in

The berry paradox

  • Conference paper
  • First Online:
Complex Systems and Binary Networks

Part of the book series: Lecture Notes in Physics ((LNP,volume 461-461))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • -G. J. Chaitin, Information, Randomness & Incompleteness, second edition, World Scientific, 1990. Errata: on page 26, line 25, “quickly that” should read “quickly than”; on page 31, line 19, “Here one” should read “Here once”; on page 55, line 17, “RI, p. 35” should read “RI, 1962, p. 35”; on page 85, line 14, “1. The problem” should read “1. The Problem”; on page 88, line 13, “4. What is life?” should read “4. What is Life?”; on page 108, line 13, “the table in” should read “in the table in”; on page 117, Theorem 2.3(q), “H c (s,t)” should read “H c (s/t)”; on page 134, line 7, “#{n H(n)≤n}≤2 n“ should read “#{k H (k)≤n}≤2 n”; on page 274, bottom line, “n 4p+4 ” should read “n 4p′+4”.

    Google Scholar 

  • -G. J. Chaitin, Algorithmic Information Theory, fourth printing, Cambridge University Press, 1992. Erratum: on page 111, Theorem Io(q), “H c (s,t)” should read “H c (s/t)”.

    Google Scholar 

  • -G. J. Chaitin, Information-Theoretic Incompleteness, World Scientific, 1992. Errata: on page 67, line 25, “are there are” should read “are there”; on page 71, line 17, “that case that” should read “the case that”; on page 75, line 25, “the the” should read “the”; on page 75, line 31, “−log2 p−log2 q” should read “−plog2 p−qlog2 q”; on page 95, line 22, “This value of” should read “The value of”; on page 98, line 34, “they way they” should read “the way they”; on page 99, line 16, “exactly same” should read “exactly the same”; on page 124, line 10, “are there are” should read “are there”.

    Google Scholar 

Recent Papers

  • -G. J. Chaitin, “On the number of n-bit strings with maximum complexity,” Applied Mathematics and Computation 59 (1993), pp. 97–100.

    Article  MATH  MathSciNet  Google Scholar 

  • -G. J. Chaitin, “Randomness in arithmetic and the decline and fall of reductionism in pure mathematics,” chao-dyn/9304002, Bulletin of the European Association for Theoretical Computer Science No. 50 (June 1993), pp 314–328.

    MATH  Google Scholar 

  • -G. J. Chaitin, “The limits of mathematics—Course outline & software,” chao-dyn/9312006 IBM Research Report RC-19324, 127 pp., December 1993.

    Google Scholar 

  • -G. J. Chaitin, “Randomness and complexity in pure mathematics,” International Journal of Bifurcation and Chaos 4 (1994), pp. 3–15.

    Article  MATH  MathSciNet  Google Scholar 

  • -G. J. Chaitin, “Responses to ‘Theoretical Mathematics...',” Bulletin of the American Mathematical Society 30 (1994), pp. 181–182.

    Google Scholar 

  • -G. J. Chaitin, “The Limits of Mathematics,” chao-dyn/9407003 IBM Research Report RC-19646, July 1994, 270 pp.

    Google Scholar 

  • -G. J. Chaitin, “The Limits of Mathematics IV”, chao-dyn/9407009, IBM Research Report RC-19671, July 1994, 231 pp.

    Google Scholar 

  • -G. J. Chaitin, “The Limits of Mathematics (Extended Abstract),” chaodyn/9407010, IBM Research Report RC-19672, July 1994, 7 pp.

    Google Scholar 

See Also

  • -M. Davis, “What is a computation?,” in L.A. Steen, Mathematics Today, Springer-Verlag, 1978.

    Google Scholar 

  • -R. Rucker, Infinity and the Mind, Birkhäuser, 1982.

    Google Scholar 

  • -T. Tymoczko, New Directions in the Philosophy of Mathematics, Birkhäuser, 1986.

    Google Scholar 

  • -R. Rucker, Mind Tools, Houghton Mifflin, 1987.

    Google Scholar 

  • -H. R. Pagels, The Dreams of Reason, Simon & Schuster, 1988.

    Google Scholar 

  • -D. Berlinski, Black Mischief, Harcourt Brace Jovanovich, 1988.

    Google Scholar 

  • -R. Herken, The Universal Turing Machine, Oxford University Press, 1988.

    Google Scholar 

  • -I. Stewart, Game, Set & Math, Blackwell, 1989.

    Google Scholar 

  • -G. S. Boolos and R. C. Jeffrey, Computability and Logic, third edition, Cambridge University Press, 1989.

    Google Scholar 

  • -J. Ford, “What is chaos?,” in P. Davies, The New Physics, Cambridge University Press, 1989.

    Google Scholar 

  • -J. L. Casti, Paradigms Lost, Morrow, 1989.

    Google Scholar 

  • -G. Nicolis and I. Prigogine, Exploring Complexity, Freeman, 1989.

    Google Scholar 

  • -B.-O. Küppers, Information and the Origin of Life, MIT Press, 1990.

    Google Scholar 

  • -J. L. Casti, Searching for Certainty, Morrow, 1991.

    Google Scholar 

  • -J. A. Paulos, Beyond Numeracy, Knopf, 1991.

    Google Scholar 

  • -L. Brisson and F. W. Meyerstein, Inventer L'Univers, Les Belles Lettres, 1991. (English edition in press)

    Google Scholar 

  • -J. D. Barrow, Theories of Everything, Oxford University Press, 1991.

    Google Scholar 

  • -D. Ruelle, Chance and Chaos, Princeton University Press, 1991.

    Google Scholar 

  • -T. Nørretranders, Mærk Verden, Gyldendal, 1991.

    Google Scholar 

  • -M. Gardner, Fractal Musci, Hypercards and More, Freeman, 1992.

    Google Scholar 

  • -P. Davies, The Mind of God, Simon & Schuster, 1992.

    Google Scholar 

  • -J. D. Barrow, Pi in the Sky, Oxford University Press, 1992.

    Google Scholar 

  • -N. Hall, The New Scientist Guide to Chaos, Penguin, 1992.

    Google Scholar 

  • -H.-C. Reichel and E. Prat de la Riba, Naturwissenschaft und Weltbild, Hölder-Pichler-Tempsky, 1992.

    Google Scholar 

  • -I. Stewart, The Problems of Mathematics, Oxford University Press, 1992.

    Google Scholar 

  • -A. K. Dewdney, The New Turing Omnibus, Freeman, 1993.

    Google Scholar 

  • -A. B. Çambel, Applied Chaos Theory, Academic Press, 1993.

    Google Scholar 

  • -K. Svozil, Randomness & Undecidability in Physics, World Scientific, 1993.

    Google Scholar 

  • -J. L. Casti, Complexification, HarperCollins, 1994.

    Google Scholar 

  • -M. Gell-Mann, The Quark and the Jaguar, Freeman, 1994.

    Google Scholar 

  • -T. Nørretranders, Verden Vokser, Aschehdoug, 1994.

    Google Scholar 

  • -S. Wolfram, Cellular Automata and Complexity, Addison-Wesley, 1994.

    Google Scholar 

  • -C. Calude, Information and Randomness, Springer-Verlag, 1994.

    Google Scholar 

  • -J. L. Casti and A. Karlqvist, Cooperation and Conflict in General Evolutionary Processes, Wiley, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, P. O. Box 704, 10598, Yorktown Heights, NY, USA

    G. J. Chaitin

Authors
  1. G. J. Chaitin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ramón López-Peña Henri Waelbroeck Riccardo Capovilla Ricardo García-Pelayo Federico Zertuche

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaitin, G.J. (1995). The berry paradox. In: López-Peña, R., Waelbroeck, H., Capovilla, R., García-Pelayo, R., Zertuche, F. (eds) Complex Systems and Binary Networks. Lecture Notes in Physics, vol 461-461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103569

Download citation

  • DOI: https://doi.org/10.1007/BFb0103569

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60339-9

  • Online ISBN: 978-3-540-44937-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation