DO NOT BELIEVE Liars that changed their name to mine speak for me --- this is libelous

A halt decider is a Turing machine that computes
the mapping from its finite string input to the
behavior that this finite string specifies.
 If the finite string machine string machine
description specifies that it cannot possibly
reach its own final halt state then this machine
description specifies non-halting behavior.
 A halt decider never ever computes the mapping
for the computation that itself is contained within.
 Unless there is a pathological relationship between
the halt decider H and its input D the direct execution
of this input D will always have identical behavior to
D correctly simulated by simulating halt decider H.
  Simulating Termination Analyzer H is Not Fooled by Pathological Input D
https://www.researchgate.net/ publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D