Optimizing recursive templates

[Stefan Koch]

On Thursday, 24 September 2020 at 20:11:53 UTC, M.M. wrote:
> On Thursday, 24 September 2020 at 19:49:44 UTC, Stefan Koch 
> wrote:
>> The Problem is essentially equivalent to this:
>>
>> Solve for the outcome of a particular state of "Conway game of 
>> live.", given an initial state and a number of steps. In 
>> constant time and at most linear space.
>
> What do you mean by constant time and linear space? In 
> classical algorithm analysis, in constant time you can only 
> access constant-size memory, so linear-space cannot really help 
> here, and your question boils down to: can you simulate the 
> game of life in constant time?

Hmm yes. Indeed.