Path: ...!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory,sci.logic,comp.ai.philosophy
Subject: Why examine the halting problem using the x86 language?
Date: Tue, 9 Jul 2024 09:37:18 -0500
Organization: A noiseless patient Spider
Lines: 21
Message-ID: <v6jhuu$1ctoi$8@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 09 Jul 2024 16:37:18 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="b5da22ad5ca0d0ccd5a9478202582a44";
	logging-data="1472274"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+YP9GuNMM5RmHQEOwHROmf"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:n4vr6HP8RzUQTWbRGUGI3A7+rik=
Content-Language: en-US
Bytes: 1793

The x86utm operating system is a proxy for a UTM and uses C
functions as proxies for Turing Machines and the x86 language
as a proxy for the Turing Machine description language.

This provides the means to make every single detail of the
halting problem 100% concrete thus totally eliminating any
false assumptions.

The second half of the paper shows how the x86 based proof
equally applies to the Peter Linz Turing machine based proof.

*Termination Analyzer H is Not Fooled by Pathological Input D*
https://www.researchgate.net/publication/369971402_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D 


The above is the clearest version of my paper so far out of about
150 rewrites.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer