Re: Turing Machine computable functions apply finite string transformations to inputs

On 2025-04-28 16:27:56 +0000, olcott said:

On 4/28/2025 4:14 AM, Mikko wrote:

On 2025-04-26 15:59:39 +0000, olcott said:
 

On 4/26/2025 3:19 AM, Mikko wrote:

On 2025-04-25 16:31:58 +0000, olcott said:
 

On 4/25/2025 3:46 AM, Mikko wrote:

On 2025-04-24 15:11:13 +0000, olcott said:
 

On 4/23/2025 3:52 AM, Mikko wrote:

On 2025-04-21 23:52:15 +0000, olcott said:
 

Computer Science Professor Eric Hehner PhD
and I all seem to agree that the same view
that Flibble has is the correct view.

 Others can see that their justification is defective and contradicted
by a good proof.
 Some people claim that the unsolvability of the halting problem is
unproven but nobody has solved the problem.

 For the last 22 years I have only been refuting the
conventional Halting Problem proof.

 Trying to refute. You have not shown any defect in that proof of the
theorem. There are other proofs that you don't even try to refute.

 Not at all. You have simply not been paying enough attention.
 Once we understand that Turing computable functions are only
allowed

 Turing allowed Turing machines to do whatever they can do.

 Strawman deception error of changing the subject away
from computable functions.

 Attempt to deceive by a false claim. The term "computable function" is
defined in terms of Turing machines so Turing machines are on topic.

 Since there is no universally agreed upon definition
of the Turing Machine language it is impossible to
provide the 100% concrete details in this Turing
Machine language.

Irrelevant. There is sufficient agreement what Turing machines are.
And that agreement does not restrict what Turing machines are allowed
to do, only what they can do.
--
Mikko