Re: game of life question
- From: Subluxian <cbrown@xxxxxxxxxxxxxxxxx>
- Date: Mon, 30 Jul 2007 14:03:16 -0700
On Jul 30, 6:58 am, Allan Adler <a...@xxxxxxxxxxxxxxxxxxxx> wrote:
Let L denote the set of all points of the plane with integer coordinates
and let P denote the set of all subsets of L. Conway's game of life
determines a mapping T from P to itself. Call an element x of P timeless
if there is a sequence x0=x, x1, x2, ... of elements of P such that, for
every positive integer n, we have T(x(n)) = x(n-1).
It seems that you are asking for those elements x in P such that T(x)
= x. These are usually called "stable configurations".
Cheers - Chas
.
- Follow-Ups:
- Re: game of life question
- From: Robert Israel
- Re: game of life question
- References:
- game of life question
- From: Allan Adler
- game of life question
- Prev by Date: Re: Elementwise rank preserving map
- Next by Date: since it is popular : here is my FLT short proof :p:p:p ;-)
- Previous by thread: Re: game of life question
- Next by thread: Re: game of life question
- Index(es):
Relevant Pages
|
