Harold McIntosh They exist for the great majority of cellular automata, and there is a considerable theory concerning the criteria according to which they exist or not, which in turn is related to the question of whether the automaton is reversible or not. A quick criterion is that the rule of evolution has to be "balanced" for an automaton to be reversible and thus not have Garden-of-Eden configurations. Life fails this, because many more neighborhoods lead to zeroes than to ones.
A more precise criterion is one called "mutual erasibility" introduced by Edward F. Moore, to be found in books on automata theory. This state of affairs notwithstanding, several persons have programmed a search for Life GOE's and found some; I think an example is shown in Poundstone's book.
So, of course, a Turing machine could undertake a similar calculation. As an aside, note that it is a Minsky register machine which has been shown to be a universal computer in Life, but ... more.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.