Skip to main content
SpringerLink
Log in

Computing the Busy Beaver Function

  • Chapter
Open Problems in Communication and Computation

Abstract

Efforts to calculate values of the noncomputable Busy Beaver function are discussed in the light of algorithmic information theory.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. G.J. Chaitin, “Algorithmic Information Theory,” in Encyclopedia of Statistical Sciences, Vol. 1, Wiley, New York, 1982, pp. 38–41.

    Google Scholar 

  2. A.K. Dewdney, “A Computer Trap for the Busy Beaver, the Hardest-Working Turing Machine,” Computer Recreations Dept., Sci. Am., 251, No. 2, pp. 19–23 (Aug. 1984).

    Google Scholar 

  3. M. Davis, “What Is a Computation?” in Mathematics Today: Twelve Informal Essays, L. A. Steen (ed.), Springer-Verlag, New York, 1978, pp. 241–267.

    Google Scholar 

  4. G.J. Chaitin, “Randomness and Mathematical Proof,” Sci. Am., 232, No. 5, pp. 47–52 (May 1975).

    Article  Google Scholar 

  5. G.J. Chaitin, “Gödel’s Theorem and Information,” Int. J. Theor. Phys., 22, pp. 941–954 (1982).

    Article  MathSciNet  Google Scholar 

  6. D.R. Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid, Basic Books, New York, 1979.

    Google Scholar 

  7. M. Gardner, “The Random Number Ω Bids Fair to Hold the Mysteries of the Universe,” Mathematical Games Dept., Sci. Am., 241, No. 5, pp. 20–34 (Nov. 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, Yorktown Heights, NY, 10598, USA

    Gregory J. Chaitin

Authors
  1. Gregory J. Chaitin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departments of Electrical Engineering and Statistics, Stanford University, Stanford, California, USA

    Thomas M. Cover

  2. Systems Principles Research, Bell Communications Research, Morristown, New Jersey, USA

    B. Gopinath

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Chaitin, G.J. (1987). Computing the Busy Beaver Function. In: Cover, T.M., Gopinath, B. (eds) Open Problems in Communication and Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4808-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4808-8_28

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-9162-6

  • Online ISBN: 978-1-4612-4808-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation