Skip to main content

Is Bosco’s Rule Universal?

  • Conference paper
Machines, Computations, and Universality (MCU 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3354))

Included in the following conference series:

Abstract

The Game of Life (Life) is a two-state, two-dimensional, nearest neighbor cellular automaton (CA), which John Horton Conway proved is universal. The Larger than Life (LtL) family of CAs generalizes Life to large neighborhoods and general birth and survival thresholds. A specific threshold-range scaling of Life to LtL yields Bosco’s rule, which is a range 5 CA with dynamics similar to Life. In the 1990s Conway challenged us to prove that rules such as Bosco’s are, like Life, universal. Here we show that Bosco’s rule supports patterns such as those used in the proof that Life is universal. Specifically, we build a sliding block memory, similar to the auxiliary storage device Conway described and claimed could be built. Our construction is based on Life’s sliding block memory designed and built by Dean Hickerson in 1990. In a companion paper we explore various questions which have arisen since Conway posed his challenge, including whether the details given in his proof that Life is universal are sufficient and what necessary and sufficient conditions are required to prove that Bosco’s rule, or any two-dimensional CA, is universal.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Gardner, M.: Mathematical games-the fantastic combinations of John Conway’s new solitaire game. Life, Sci. Am. 223, 120–123 (1970)

    Google Scholar 

  2. Summers, J.: Game of Life status page, entropymine.com/jason/life/status.html

    Google Scholar 

  3. Berlekamp, E., Conway, J., Guy, R.: What is Life? In: Winning Ways for Your Mathematical Plays, vol. 2, ch. 25. Academic Press, New York (1982)

    Google Scholar 

  4. Griffeath, D.: Self-organization of random cellular automata: four snapshots. In: Grimmett, G. (ed.) Probability and Phase Transitions. Kluwer Academic, Dordrecht/Norwell (1994)

    Google Scholar 

  5. Evans, K.: Larger than Life: it’s so nonlinear, Ph.D. dissertation, University of Wisconsin - Madison (1996), http://www.csun.edu/~kme52026/thesis.html

  6. Evans, K.: Threshold-range scaling of Life’s coherent structures. Physica D 183, 45–67 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hickerson, D.: Description of sliding block memory (1990), http://www.radicaleye.com/lifepage/patterns/sbm/sbm.html

  8. Griffeath, D.: Primordial Soup Kitchen, http://psoup.math.wisc.edu/kitchen.html

  9. Evans, K.: http://www.csun.edu/~kme52026/bosco/bosco.html

  10. Silver, S.: Life Lexicon Home Page, http://www.argentum.freeserve.co.uk/lex_home.htm

  11. Minsky, M.: Computation: Finite and Infinite Machines. Pren. Hall (1967) Sec. 15.1

    Google Scholar 

  12. Chapman, P.: Life Universal Computer (2002), http://www.igblan.freeonline.co.uk/igblan/ca/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Evans, K.M. (2005). Is Bosco’s Rule Universal?. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31834-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25261-0

  • Online ISBN: 978-3-540-31834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics