XPost: comp.theory, sci.logic, sci.math

On 1/5/2022 8:46 AM, Malcolm McLean wrote:

On Wednesday, 5 January 2022 at 14:31:17 UTC, olcott wrote:

On 1/5/2022 5:01 AM, Julio Di Egidio wrote:

On Wednesday, 5 January 2022 at 06:34:32 UTC+1, [email protected] wrote: >>>> On 1/4/22 11:15 PM, olcott wrote:

On 1/4/2022 10:09 PM, Richard Damon wrote:

On 1/4/22 10:43 PM, olcott wrote:

On 1/4/2022 8:04 PM, Richard Damon wrote:

On 1/4/22 7:29 PM, olcott wrote:

On 12/19/2021 4:25 PM, Malcolm McLean wrote:

On Sunday, 19 December 2021 at 19:04:11 UTC, Jeff Barnett wrote: >>>>>>>>>>> On 12/19/2021 11:44 AM, olcott wrote:

FAIL.

STOP FEEDING THE TROLLS: you fucking retarded spamming pieces of shit are the true disgrace here.

*Plonk*

Julio

Dumb Bunny !!!

Plonk is a Usenet jargon term for adding a particular poster to one's
kill file so that poster's future postings are completely ignored.
https://news.ycombinator.com/item?id=26890646

Julio has added Richard to his kill file, because he is annoyed by his responses
to you. The "plonk" suggests that other people do the same.

No not at all, Julio has very persistently (over the years) proved that
he has no idea what the term "Plonk" means. He continues to respond to
people that he has "Plonked" after he has "Plonked" them.

I will not be doing so. Though I do agree that Richard doesn't have anything much
new to say that hasn't been said many times already, I'll leave it to his judgement
whether it is worth repeating essentially the same point many times over.

This aspect of your assessment is incorrect:
This aspect of your assessment is incorrect:
This aspect of your assessment is incorrect:

On 12/19/2021 4:25 PM, Malcolm McLean wrote:

But in answering that question, we set up a system in which
the simulating halt decider must get the wrong answer,

Everyone that ever said that it must get the wrong answer did not
understand the computer science well enough.

A halt decider only computes the mapping of its inputs ⟨Ĥ⟩ ⟨Ĥ⟩ to an accept / reject state. It must do this entirely on the basis of the
actual behavior specified by these actual inputs.

As long as no amount of simulation by the simulating halt decider would
ever cause the simulated input to reach its final state we know by the
Linz definition of halting that this input specifies a non halting
computation.

Computation that halts: the Turing machine will halt whenever it enters
a final state. (Linz:1990:234)

As long as the input to a halt decider specifies a non halting
computation then

this by itself is an entirely sufficient condition
this by itself is an entirely sufficient condition
this by itself is an entirely sufficient condition
this by itself is an entirely sufficient condition

for the halt decider to transition to its reject state.

--
Copyright 2021 Pete Olcott

Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)