The Recursion Theorem from a Different Angle
Logic in Computer Science
2018-01-12 v2
Abstract
This paper is about computability. I claim the likely existence of a program DoesHalt(Program, Input) such that DoesHalt( HaltsOnItself, AntiSelf ) halts with resounding 'NO'. HaltsOnItself( Program ) is simply DoesHalt( Program, Program ). AntiSelf() is a self-referential self-contradictory program that loops when HaltsOnItself() returns 'YES' and halts when HaltsOnItself() returns 'NO'.
Keywords
Cite
@article{arxiv.1610.04592,
title = {The Recursion Theorem from a Different Angle},
author = {X. Y. Newberry},
journal= {arXiv preprint arXiv:1610.04592},
year = {2018}
}
Comments
This paper has been superseded by "Getting around the Halting Problem" https://arxiv.org/abs/1706.03392