Question: Give an implementation-level description of a Turing Machine that computes the maximum of two unary positive numbers. Let = {1,#} be the input alphabet, assume
Give an implementation-level description of a Turing Machine that computes the maximum of two unary positive numbers. Let = {1,#} be the input alphabet, assume the tape alphabet = {1,#,=,}. The problem of computing max{m,n} could be represented by the string 1m#1n. If the tape is initialized with this string, then it will halt with the tape having the string 1m#1n#1max{m,n}.
Can someone help me understand how the description of this machine would go?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
