On 2024-01-19 13:54:26 +0000, olcott said:
*This is the correct definition of a decider*
Deciders always must compute the mapping from an input finite string to
their own accept or reject state on the basis of a syntactic or semantic property of this finite string.
No, it isn't. A correct definition must specify
- the defined term in its dictionary form
(in this case, "A decider" instead of "Deciders")
- an upper term
(in this case "is a Turing machine" or "is an algorithm")
- an differentiating feature
(in this case, that it accepts or rejects every valid input,
and other restrictions you consider essential)
Mikko
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)