Page 1 of 1
3. (5 points) Informal Turing Machine Algorithms: write out an algorithm that passes through a TM tape and accepts (ie h
Posted: Tue Jul 12, 2022 8:11 am
by answerhappygod
- 3 5 Points Informal Turing Machine Algorithms Write Out An Algorithm That Passes Through A Tm Tape And Accepts Ie H 1 (38.42 KiB) Viewed 32 times
- 3 5 Points Informal Turing Machine Algorithms Write Out An Algorithm That Passes Through A Tm Tape And Accepts Ie H 2 (38.42 KiB) Viewed 32 times
3. (5 points) Informal Turing Machine Algorithms: write out an algorithm that passes through a TM tape and accepts (ie halts after running the algorithm) if the input is in the language and rejects (ie halts before completing the algorithm) otherwise. Note that you can only using one TM with one tape in this case. a. An algorithm which adds two numbers and subtracts a third on a tape. Ex: [...b1111b111b1...]-> 4+3-1->[...b1111111b] Ex:[...bl1bb1]->2+0-1 >>[...blb] b. An algorithm which multiples two numbers on a tape. Ex: [111b11]-> 3*2-> [...b11111lb]