Consider the function f(n) = = n + 3 for n >= 1. We wish to create a Turing Machine transducer to compute f(n) for all i
Posted: Fri May 20, 2022 1:11 pm
- Consider The Function F N N 3 For N 1 We Wish To Create A Turing Machine Transducer To Compute F N For All I 1 (318.95 KiB) Viewed 41 times
Consider the function f(n) = = n + 3 for n >= 1. We wish to create a Turing Machine transducer to compute f(n) for all input n>=1. For example if n = 4 then the input will be #1111# on the TM tape and the output will be #1111111# on the TM tape. The underline indicates where the r/w head should be. Decide which of the following Turing Machines is a Turing Machine transducer for f? M1 1:1, R 1:1,L عربسته Shanno 1:1.L. :1, 0:1,R 0:1,L 0:0,R 92 93 q4 45 Is M1 a Turing Machine transducer for f? [Select ] M2 1:0,R 0:1,R 1:1.L BB 0:1,R 0:1.L qo 0:0,R q2 q3 Is M2 a Turing Machine transducer for f? [Select ] M3 1:1, 1:1.L ཀྱི་ནམ་ཟླ་ བའི་ཚེ ། 01 0:1, R. 0:1,L q1 92 0:0,R q3 94 Is M3 a Turing Machine transducer for f? [ Select ]