Self Initializing Cellular Automata

Asked Oct 17 '18 at 23:32

Active Oct 17 '18 at 23:32

Viewed 48 times

What is the largest cellular automata one can generate given the conditions:

-n x m rectangular grid

-Basic Conway Rules

-Grid is not continuous (meaning edge behavior is not wrapped)

-perfectly/near perfectly reproduces its initialization pattern (therefore recursive).

asked Oct 17 '18 at 23:32

Numoru

homework or what? – tod Oct 18 '18 at 00:51
no just a question – Numoru Oct 21 '18 at 14:55
still waiting on an answer here. – Numoru Oct 30 '18 at 06:57
Your question has received very little attention here. I think the right forum for this question will be [Computer Science Stack Exchange](https://cs.stackexchange.com/). Try posting there. thanks – tod Nov 01 '18 at 01:36
Any kind of still life or oscillator pattern... Make some search on the subject you will find a lot! – Jean-Baptiste Yunès Nov 01 '18 at 15:53
You need reproductioni isn't it? Then look at autorepoductive pattern it has been a long field of research in the past. There exists a lot of patterns. – Jean-Baptiste Yunès Nov 01 '18 at 15:55

0 Answers0