Liste des Groupes | Revenir à theory |
On 4/28/2025 11:54 AM, dbush wrote:No, that *IS* the behavior specified, that behavior is just not computed by HHH.On 4/28/2025 12:38 PM, olcott wrote:It is NEVER a computable function because no haltOn 4/28/2025 10:41 AM, dbush wrote:>On 4/28/2025 11:35 AM, olcott wrote:>On 4/28/2025 10:18 AM, dbush wrote:>On 4/28/2025 11:01 AM, olcott wrote:>On 4/28/2025 2:33 AM, Richard Heathfield wrote:>On 28/04/2025 07:46, Fred. Zwarts wrote:>
>
<snip>
>So we agree that no algorithm exists that can determine for all possible inputs whether the input specifies a program that (according to the semantics of the machine language) halts when directly executed.>
Correct?
Correct. We can, however, construct such an algorithm just as long as we can ignore any input we don't like the look of.
>
The behavior of the direct execution of DD cannot be derived
by applying the finite string transformation rules specified
by the x86 language to the input to HHH(DD). This proves that
The assumption that an H exists that meets the below requirements is false, as shown by Linz and others:
>
I have just proved that those requirements are stupidly wrong
Category error. The mapping exists
Computable functions are the formalized analogue
of the intuitive notion of algorithms, in the
sense that a function is computable if there
exists an algorithm that can do the job of the
function, i.e.
i.e. a computable function is a mathematical mapping for which an algorithm exists to compute in.
>
And the halting function below is not a computable function:
>
decider can ever directly see the behavior of
the directly executed DD because this DD IS NOT AN INPUT.
The one that IS AN INPUT SPECIFIES DIFFERENT BEHAVIOR.
I don't understand how you can stupidly disagree withBut the x86 languge, which is what the x86 processor is the DEFINTION of what it is, shows you wrong.
the x86 language without being a troll having no interest
in truth.
Les messages affichés proviennent d'usenet.