title: A set of languages over {0, 1} which does not belong to Recursively Enumerable set are uncountable
body: <p>I have a problem of <strong>Theory of Computation</strong> i.e. </p>
  
  <p>Prove that</p>
  
  <blockquote>
    <p>A set of languages over an alphabet Σ = {0, 1} which does not belong to Recursively Enumerable set, are uncountable.</p>
  </blockquote>
  
  <p>Anyone can explain it in some simple way?</p>