Re: Professor Eric Hehner's brilliant work --- isomorphisms

Am Tue, 22 Apr 2025 13:18:42 -0500 schrieb olcott:

On 4/22/2025 6:06 AM, Richard Damon wrote:

On 4/21/25 11:16 PM, olcott wrote:

On 4/21/2025 7:46 PM, Richard Damon wrote:

On 4/21/25 7:43 PM, olcott wrote:

On 4/21/2025 5:43 PM, Richard Damon wrote:

On 4/21/25 4:27 PM, olcott wrote:

WST Workshop on Termination, Oxford, 2018 Objective and Subjective
Specifications Eric C.R. Hehner Department of Computer Science,
University of Toronto
>
(6) Can Carol correctly answer “no” to this (yes/no) question?
https://www.cs.toronto.edu/~hehner/OSS.pdf
>
Is the perfect example of isomorphism to the halting problem's
pathological input. The halting problem input D derives a self-
contradictory question for H the same way that Carol's question is
self-contradictory for Carol.

>
No it isn't, as Carol is a voltional being while a decider is
deterministic.
>

How long are you going to pretend that you don't know what
isomorphisms are?

>
When are you going to stop[ abusing the term.
To be an ISO-MORPHISM, they need to be "of the same shape".
The to things aren't of the same shape, as they aren't even of the
same type.
Thus, your comparison is just an ACTUAL type error, verse you made-up
type of type error.
>

Bijective mapping.
>

So, what BIjection are you talking about?
Carol, as she sits there can give two answers, Yes, or No.

 
and both of them are the wrong answer.

Only when Carol gives it. The correct answer is the opposite.

When DD is able to actually do the opposite of whatever value that HHH
reports (it can't possibly do this) then HHH is being asked a question
where both yes and no are the wrong answer.

DD can most definitely do the opposite. Why shouldn't it?
Like Carol, HHH is incapable of answering correctly.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.