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

That's a great complement to the simple description of the machine (adding symbols one at a time), and I'll add it to my page ( mrob.com/pub/math/seq-google-turing.html ) On 6/24/12, Adam P. Goucher <apgoucher@gmx.com> wrote:

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

-- Robert Munafo -- mrob.com Follow me at: gplus.to/mrob - fb.com/mrob27 - twitter.com/mrob_27 - mrob27.wordpress.com - youtube.com/user/mrob143 - rilybot.blogspot.com