Show that the Bare Bones language would remain a universal language if the while statement were replaced with a posttest loop expressed in the form repeat: ...        until (name equals 0) Give an...

Show that the Bare Bones language would remain a universal language if the while statement were replaced with a posttest loop expressed in the form

repeat: ...

       until (name equals 0)

Give an example of a language that is not deterministic. Design a Turing machine that recognizes the set of palindromes in {a, b}* such that the number of as is a multiple of three.