Write a classical Turing machine program that computes the addition of non-negative binary numbers. The numbers to be added are given as non-empty binary strings that may have different lengths. Leading zeros are allowed for the input, but not for the output (except for result 0). The two numbers to be added are separated by a blank. For example, input "1#10" yields output "11" and input "01#001" yields output "10".

Answer rating: 100% (QA)

defremoveZeroa try return aaindex1 except return 0 def addab carry 0 small a1 large b1 i... View the full answer