Turing machine to Multiply two binary numbers.
Example: ’10*10′ => ‘100’, ’11*10′ => ‘110’.
Let’s test the turning machine with the input as ’11*1′ # 3*5 = 15 (1111 in binary)
Note:
1>1>R and 1>R are same things. Both represent read 1, write 1, and move right.
[ and Delta and empty cell of tape are the same things
Turing machine to Multiply two binary numbers with animations
Read More Examples of Turing Machine
 Turing Machine to copy a string: with animations
 Turing Machine of numbers divisible by 3: with animations
 Turing machine for anbncn: with animations

Turing machine of two equal binary strings: with animations

Turing Machine to Accepts palindromes: with animations

Turing machine for a’s followed by b’s then c’s where the number of a’s multiplied by the number of b’s and equals to the number of c’s: with animations

Turing machine to Add two binary numbers: with animations
 Turing machine to Multiply two unary numbers: with animations
 Turing machine to Multiply two binary numbers: with animations
 Turing Machine for the complement of a string
 Turing Machine for the language of a^{n}b^{n} where a=b.
 Turing Machine for a is less than b, a^{m}b^{n} where a=b or m=n.

Turing machine for the language of all those string in which a is less than b