How can we construct TMs such that it accepts(Give description only):
a + b = c
a . b = c
Input is of the form a#b#c.
a,b and c belongs to {0,1}* and are positive binary unsigned integers.
I know that we can construct TMs if the input has unary representation but how to solve if it has binary representation?
Well, binary addition and multiplication are a bit more involved than in the unary case, but not that difficult. For addition:
For multiplication you can use a method like this one . This will be some work to program on a TM if you really have to do it in detail.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.