Pseudorandom number generator
Posted: July 7th, 2010, 5:20 pm
I am interested in a life pattern with a pseudorandom number generating algorithm. It seems like it should be possible to program such an algorithm into a universal constructor. That may not even be the only way.
In the pattern
An expanding feed-back loop generates a recursive sequence of gliders that could function as a pseudorandom binary string. Some additional components would be needed to duplicate the glider stream, and another mechanism would be necessary to generate non-binary values. Unfortunately, in this case, the glider duplicator would have to travel with the stream, which would require a knight-ship. On top of that, it would have to accept gliders at generations which are multiples of 50, and no period 50 knight-ship is currently known. Also, the fact that this pattern exhibits infinite growth would make it difficult to use.
While this particular pattern is not very useful, it does suggest that pseudorandom number generators are possible in life. Of course, life is probably not the easiest rule to use, and I would expect it would be possible to define a rule in which a pseudorandom number generator would be trivial (though it may have a very large number of states).
In the pattern
Code: Select all
x = 38, y = 53, rule = B3/S23
34b4o$33bo3bo$37bo$36bo3$34bo$35bo$35bo$34b2o$28bo4bo$27b2o3$34b4o$33b
o3bo$37bo$36bo25$11bo$10b2o5$bo8bo4bo$o5bo2bo4bo$o6b3o4bo$o2bo10bo2bo$
3o11b3o!
While this particular pattern is not very useful, it does suggest that pseudorandom number generators are possible in life. Of course, life is probably not the easiest rule to use, and I would expect it would be possible to define a rule in which a pseudorandom number generator would be trivial (though it may have a very large number of states).