O(sqrt(log(t)))

O(sqrt(log(t))) is a pattern constructed by Adam P. Goucher in 2010,^{[citation needed]} which uses an unbounded triangular region as memory for a binary counter. Empty space is read as a zero, and a boat as a one, as shown below:

<html><div class="rle"><div class="codebox"><div style="display:none;"><code></html>x = 43, y = 18, rule = B3/S23 15b2o24b2o$15b2o24b2o2$11bo$10bobo$11b2o3$6b2o24b2o$5bo2bo22bo2bo$6b2o 24b2o3$b2o24b2o$o2bo22bo2bo$b2o6b3o15b2o6b3o$9bo25bo$10bo25bo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] #C [[ THEME 6 GRID THUMBLAUNCH THUMBSIZE 2 HEIGHT 400 WIDTH 640 ZOOM 12 ]]<html></code></div></div><canvas width="200" height="300" style="margin-left:1px;"><noscript></html>

Please enable Javascript to view this LifeViewer.

(click above to open LifeViewer)
RLE: here Plaintext: here

The pattern's diametric growth rate is O(sqrt(log(t))), which is the slowest possible for any Life pattern, or indeed any 2D Euclidean cellular automaton. Since the population returns infinitely often to its initial minimum value (during carry operations from 11111...1 to 100000...0, it can be considered to be an unusual form of sawtooth.

Also see

gollark: Project setup with what?

gollark: Which is a major part.

gollark: And logistics.

gollark: Sounds quite cool, then, I might get that.

gollark: That's unrelated.

External links

O(sqrt(log(t))) at the Life Lexicon

This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.