On 6/23/12, Mike Stay <metaweta@gmail.com> wrote:
That has period 90. It repeats this binary string: 11010110110101101011011010110110101101011011010110101101101011011010110101101101011011010
Not quite. Your string (which has 89 characters, making more sense given your conclusion) occurs twice, then we get 1101011011010110101101101011011010110101101101011011010 which has 55 characters, then another of the 89-character one. If we set A to be your 89-character string, and B = the 55-character string, then the output of the mystery Turing machine starts: A A B A A B A B A A B A A B A B A A B ... which bears some resemblance to the original string, but it's not just simply replacing 1/0 with A/B. On 6/23/12, Mike Stay <metaweta@gmail.com> wrote:
On Fri, Jun 22, 2012 at 9:40 PM, Robert Munafo <mrob27@gmail.com> wrote:
By step 49720, it has written: 1101011011010110101101101011011010110101101101011010110110101101101011010110110101101101011010110110101101011011010110110101101011011010110101101101011011010110101101101011011010110101101101011010110110101101101011010110110101101101011010110110101101011011010110110101101011011010110101101101011011010110101101101011011010110101101101011010110110101101101011010110110101101011011010110110101101011011010110110101101011011010110101101101011011010110...
It looks remarkably like this sequence that grows like Fibonacci's rabbits: 0 1 10 101 10110 10110101 1011010110110 101101011011010110101 ...
-- 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