title: Reduce SAT to HALT
body: <p>How can we reduce Boolean SAT problem to HALTING problem? I tried it, but have no idea how to begin. <br>Eventually, I wanted to prove HALT is NP-HARD, so is there a better method than this to prove HALT is NP-HARD?</p>