Hi! I am going over the prrof of how Turing machines are countable but the set of all languages are uncountable as part of the decidability unit. And I cannot come terms with the fact that E* (combos of a finite set of alphabets) is countable. Would apreciate someone disproving me .