Re: [math-fun] The final Google Turing puzzle: whatis 11010110110101101011011...

24 Jun 2012

      I believe this works:

10 Begin with the empty string
20 Apply L-system rules '1' -> '10', '0' -> '1'.
30 Prepend '1' to the string
40 GOTO 20

Here are the first few iterations:

1
110
110101
11010110110
1101011011010110101

Sincerely,

        Adam P. Goucher