1 - Weebly

20. Explain how a TM can be used to determine the given number is prime or not? It takes a binary input greater than 2,written on the first track, and determines. whether it is a prime. The input is surrounded by the symbol $ on the first track. Theory of Computation 24. To test if the input is a prime, the TM first writes the number 2 in ... ................
................