Turing Machine
← All Turing Machine questions
How does verifier 36 work when the digit sum is 12, and is a result on that sum a bug?
Verifier 36 knows only one of its three divisibility statements (by 3, 4 or 5), so a check on a sum of 12 does not show which one it knows. A result that matches only the divisible-by-3 test is not a bug.