title: A language that can be recognised by a TM but cannot be decided by a TM?
body: <h2>Can a language which can be recognised by a TM but cannot be decided by a TM?</h2>
  
  <blockquote>
    <p>example of a language which can be recognised by a TM but cannot be
    decided by a TM</p>
  </blockquote>
  
  <p>Would the answer be:</p>
  
  <pre><code> TM={&lt;M,w&gt; M is a TM that accepts input string w}
  </code></pre>
  
  <p>Could I be wrong?</p>
  
  <hr>
  
  <h2>What is the difference between decidability and recognisability?</h2>
  
  <p>In short, Any string that a recognized by a TM is called TM recognizable whereas any strings that is acceptable by a TM is called TM decidable. </p>