Hey, my Discrete Math teacher wants me to simulate Fibonacci's sequence on a Turing Machine using Visual Turing program. I didn't sleep last night trying to solve this thing. Need some help from you guys.
Well start by deciding exactly what you want the TM to do.
1. Start on an otherwise blank tape marked with![]()
's (I am assuming the alphabet the symbols may be chossen from is
) with the reading head positioned over the rightmost non-blank cell. Finish with an otherwise blank tape with the reading head over the right most
of a block
![]()
's
2. Start over on an otherwise blank tape marked with![]()
's seperated by one blank from a block of
![]()
's, end with a tape otherwise blank with
and
![]()
's seperated by a blank.
...
CB