novaBBS - comp.theory - Another definition of the Halting Problem

Another definition of the Halting Problem

<up83mr$enhv$2@dont-email.me>

https://www.novabbs.com/devel/article-flat.php?id=52293&group=comp.theory#52293

Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: new...@immibis.com (immibis)
Newsgroups: comp.theory
Subject: Another definition of the Halting Problem
Date: Mon, 29 Jan 2024 12:55:07 +0100
Organization: A noiseless patient Spider
Lines: 9
Message-ID: <up83mr$enhv$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 29 Jan 2024 11:55:08 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="b0b3ed3a6362d425acbe38082e68084f";
logging-data="482879"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19gEDTqaJ/w5LVLcbAcEmxP"
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101
Thunderbird/102.14.0
Cancel-Lock: sha1:lLLvGRP8sJA/iPdrWdvTPD0QsOU=
Content-Language: en-US

by: immibis - Mon, 29 Jan 2024 11:55 UTC

Every Turing machine/input pair has an execution sequence (term invented
by me. Richard and Mikko surely understand the idea.).
It never has more than one.
Every sequence is finite or infinite.
The halting problem asks: Is this Turing machine/input pair's execution
sequence finite?

Olcott does not understand this and ignored this the last time I
mentioned it, which proves dishonesty.

Delta: We're Amtrak with wings. -- David Letterman

devel / comp.theory / Another definition of the Halting Problem

Subject	Author
Another definition of the Halting Problem	immibis