Jump to content

Byl's loop

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by William R. Buckley (talk | contribs) at 21:56, 18 November 2006 (Initial Page. ~~~~). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Byl's loop

A simplification of the Langton loop. The chief issue is the simplicity available within Langton's cellular automata rule-set.