title: M is a Turing machine that accepts string w and does not accept string ε
body: <p>I need to prove whether this language is recognizable or not:</p>
  
  <blockquote>
    <p>{ &langle;M, w&rangle;: M is a Turing machine that accepts string w and does not accept string ε }</p>
  </blockquote>
  
  <p>I figure I could do a reduction on A<sub>TM</sub>, but how do I handle the empty string?</p>