Set Theory and Logic


Refutation of the Halting Problem: not a Problem

Authors: Colin James III

Alan Turing's difficulty was in expressing the halting problem in the format of a two-valued logic which was not as expressive as in a four-valued logic to show nuances of what exactly the equation stated. In comparison to Gödel's incompleteness theorems, Turing's halting problem has no superficial similarities other than being refuted as not a problem. Hence in contrast, both expressions are disparate and ultimately unrelated as to content meaning. Therefore: The assumption that there is a consistent and complete axiomatization of all true first-order logic statements about natural numbers must be tautologous.

Comments: 2 Pages. © Copyright 2018 by Colin James III All rights reserved.

Download: PDF

Submission history

[v1] 2018-01-16 09:29:47

Unique-IP document downloads: 911 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus