8. Equivalence of TMs, PMs and Markov algorithms - Jn.inf.ethz.ch

final tape content # a a ... a b b ... b ---.2) Given two natural numbers i > 0, j > 0 in unary notation, produce the output min(i, j) in unary.3) Given two natural numbers i > 0, j > 0 in unary notation, produce the output max(i, j) in unary.4) Optional: Given two natural numbers i > 0, j > 0 in unary notation, produce the output LCM(i, j) in unary.LCM denotes the Least Common Multiple.Hint: In Exorciser you will find a Markov algorithm for computing the Greatest Common Divisor GCD(i, j).End of Chapter 8