O(n) (challenge?)

A forum where anything goes. Introduce yourselves to other members of the forums, discuss how your name evolves when written out in the Game of Life, or just tell us how you found it. This is the forum for "non-academic" content.
Post Reply
User avatar
Posts: 307
Joined: October 29th, 2021, 6:54 pm
Location: 30.541634, 47.825445 (on the boat)

O(n) (challenge?)

Post by Wyirm » August 31st, 2022, 10:13 am

What is the slowest series of superlinear growth rates constructible in cgol? For clarification, a "series" of growth rates is any set of functions which can be represented as steps in an iterative function, and each O(n) should grow either faster or slower than the next. An example of such series is x, xlog(x), xlog(log(x)), Mandelbrot set (the function in particular is one of these), (x+a)^n, etc. My question is what cgol-constructible series of growth rates approaches O(n)=x fastest. So far I know of embedded logarithms, but there may be faster alternatives.

Code: Select all

x = 36, y = 28, rule = TripleLife
Bow down to the Herschel

Post Reply