Abstract

A simulating halt decider correctly predicts what the behavior of its input would be if this simulated input never had its simulation aborted. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. When simulating halt decider H correctly predicts that directly executed D(D) would remain stuck in recursive simulation (run forever) unless H aborts its simulation of D this directly applies to the halting theorem.