Halting Problem Counter Example Input Rejected Under Operational Semantics

Abstract

The ultimate measure of the behavior that a finite string input specifies to its simulating termination analyzer (STA) is DD simulated by HHH according to the semantics of the C programming language. When HHH(DD) is construed as operating under operational semantics it rejects DD as non-well-founded.

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Halting Problem Simulation in C.P. Olcott - manuscript
Halting Problem and Proof Theoretic Semantics.P. Olcott - manuscript
Simulating Termination Analzyers overcome conventional halting problem proof method.P. Olcott - manuscript
Simulating Termination Analzyers overcome conventional halting problem proof method.P. Olcott - manuscript
Halting Problem Simulation Paradox.P. Olcott - manuscript
Simulating Termination Analyzer H is Not Fooled by Pathological Input P.P. Olcott - manuscript
Simulating Termination Analyzer applied to the HP counter-example input.P. Olcott - manuscript
Rebutting the Sipser Halting Problem Proof V2.P. Olcott - manuscript
Simulating (partial) Halt Deciders Defeat the Halting Problem Proofs.P. Olcott - manuscript
Halting Problem Proof Counter-Example is Isomorphic to the Liar Paradox.P. Olcott - manuscript

Analytics

Added to PP
2026-01-15

Downloads
195 (#207,156)

6 months
166 (#72,026)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references