# Question: assume that a procedure is formalized as a turing machine...

###### Question details

Assume that a procedure is formalized as a Turing machine that can be represented as a finite length string from a finite alphabet. Thus any string over this alphabet is a Turing machine. Is the set of all Turing machines countable? Explain. Give an effective enumeration of all Turing machines (that is, show a "procedure" that will list all Turing machines.)