----------------------------------------------------------------------------------
@MSGID: 1@dont-email.me> 5519aa84
@REPLY: 1@dont-email.me> 91573a5a
@REPLYADDR Mikko <mikko.levanto@iki.fi>
@REPLYTO 2:5075/128 Mikko
@CHRS: CP866 2
@RFC: 1 0
@RFC-Message-ID: 1@dont-email.me>
@RFC-References: 3@dont-email.me>
1@dont-email.me> 1@dont-email.me> 1@dont-email.me>
1@dont-email.me> 1@dont-email.me>
@TZUTC: 0300
@PID: Unison/2.2
@TID: FIDOGATE-5.12-ge4e8b94
On 2023-08-13 14:48:37 +0000, olcott said:
> On 8/13/2023 2:26 AM, Mikko wrote:
>> On 2023-08-12 15:01:40 +0000, olcott said:
>>
>>> On 8/12/2023 4:13 AM, Mikko wrote:
>>>> The problem statement clarly states that in this particular case D(D)
>>>> is the computation about which H is required to answer. That is all
>>>> one can understand about what H must do. Any further understanding is
>>>> misunderstanding.
>>
>>> "A decision problem is a yes-or-no
>>> question on *an infinite set of inputs*"
>>> https://en.wikipedia.org/wiki/Decision_problem#Definition
>>
>> Irrelevant as neither the halting problem nor the definition of
>> of "termination analyzer" contains the expression "decision problem".
>>
>> Mikko
>>
>
> So you do not understand that a halt decider is a decider?
I understand that that question is not answered by the definition
of the a "halt decider". A halt decider is whatever satisfies the
definition of a "halt decider" whether you call it a decider or not.
Whether a halt decider is a decider or hot depepends on your definition
of a "decider". Usually a definition that is satisfied by any halt
decider is used but perhaps you are folowing an author that has a
different definition.
Mikko
--- Unison/2.2
* Origin: - (2:5075/128)
SEEN-BY: 5001/100 5005/49 5015/255 5019/40 5020/715
848 1042 4441 12000
SEEN-BY: 5030/49 1081 5058/104 5075/128
@PATH: 5075/128 5020/1042 4441