Halting problem undecidability and infinitely nested simulation (V5)

Abstract

This is an explanation of a key new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. To fully understand this paper a software engineer must be an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 process emulator is. No knowledge of the halting problem is required.

Author's Profile

Analytics

Added to PP
2022-04-22

Downloads
162 (#74,443)

6 months
60 (#66,134)

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?