Forwarded message: From: Eugen Leitl <eu...@leitl.org> Date: Mon, 7 Nov 2011 09:03:52 +0100 To: kragen-ha...@canonical.org Subject: Re: generating Gray code with an iterated function system User-Agent: Mutt/1.5.18 (2008-05-17)
On Mon, Nov 07, 2011 at 01:40:13AM -0500, Kragen Javier Sitaker wrote: > On Sun, Nov 06, 2011 at 08:26:32PM -0500, Kragen Javier Sitaker wrote: > > Serendipitously, I just made the remarkable discovery that the usual > > Gray code can be approximately generated by a very simple linear > > iterated function system (“IFS”) with two transforms. > > This seems to have been previously discovered by [J.A. Oteo and J. Ros][0] in > 2005; they investigated it in considerably more depth! > > [0]: http://arxiv.org/abs/nlin/0510032 > (A fractal set from the binary reflected Gray code, J. Phys. A: Math. Gen. > 38 (2005) 8935-8949) Kragen, do you see a computationally (=fewest amounts of gates) cheapest way of counting in Gray code that only does local (or as close to local) bit flips? -- Eugen* Leitl <a href="http://leitl.org";>leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://www.ativel.com http://postbiota.org 8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE -- To unsubscribe: http://lists.canonical.org/mailman/listinfo/kragen-discuss
