Is it possible to create a pattern that exhibits infinite growth that fits in a 10x10 bounding box?
Yeah, the disjoint union of the 5x5 infinite growth seed and an isolated live cell.
What about 100x100?
What about 10^n by 10^n?
See above, also.
Is there a formula that will determine the eventual population of a methuselah based on its initial bounding box?
No. The maximum eventual population of a methuselah in an n*n box overtakes any computable function of n.
Which loop is most efficient in a methuselah soup search algorithm:
The for loop is a special case of a while loop; performance depends entirely on implementation.
Why do we use the word methuselah?
Methuselah was a biblical character (patriarch, I believe) in the Old Testament who lived to 969 years of age.
Why not "zork" or "bleep"?
Bleeps are typically short-lived pulses of sound, therefore inappropriate for something so long-lived. Extrapolate from there.
And finally, is it possible to create a UCC program that creates methuselahs, moves itself to another location, then makes another methuselah? (Might just be idle fantasizing)
Yes, of course it's possible
. Certainly impractical, though.