Can anyone design a turning machine which does the multiplication of integer n and m? The input tape starts with a string n+1 1s. This string represents integer n. After this string, there is a blank symbol B. After blank symbol, there is the other string which are m+1 1s. This string represents integer m. After computation, the turning machine should halt with n*m+1 1s on the tape. The result string represents the product of integer n and m. Of course, the tape alphabets are 0, 1 and B.
For example, if I want to to the multiplcation of integer 2 and 3. The input tape should have string 111B1111. After computation, the turing machine should halt with the string 1111111 on the tape. Thanks.
