Consider the function f(n) = n-3 for all n >=3. Create a plan for a Turing Machine transducer that will compute f(n) for

[answerhappygod]

Consider The Function F N N 3 For All N 3 Create A Plan For A Turing Machine Transducer That Will Compute F N For 1 (74.55 KiB) Viewed 48 times

（If possible, please type your answer, thanks）
Consider the function f(n) = n-3 for all n >=3. Create a plan for a Turing Machine transducer that will compute f(n) for all n >=3. Use unary notation. If f(n) = 0, write the answer as 0. For example if n = 5 then the input will be #11111# on the TM tape and the output will be #11# on the TM tape. If n = 3 then the input will be #111# and the output will be #O# . The underline indicates where the r/w head is. The # represents a blank cell. You can assume that n >=3. Your plan should be a very clear description of how your Turing Machine transducer will work. After you write your plan, use it to clearly show how the TM tape changes for the case where n = 7.