Halting problem undecidability and infinitely nested simulation (V2)

Abstract

The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.

Author's Profile

Analytics

Added to PP
2021-11-10

Downloads
724 (#27,234)

6 months
307 (#5,066)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?