Optimizing recursive templates
uplink.coder at googlemail.com
Thu Sep 24 19:49:44 UTC 2020
I am starting this thread to talk about the feasibility of
rewriting recursive templates as iterative internal forms.
This addresses the general issue and does not concern itself with
particular local instances of the problem which may be solvable
with lesser means.
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.
Also particular configurations of cells may change local
evaluation rules of the automaton.
So it's my challenge to you.
Can you proof or refute the existence of a closed form function
which can simulate the game of life in constant time ?
More information about the Digitalmars-d