Groups | Search | Server Info | Login | Register
Groups > comp.theory > #137460
| From | wij <wyniijj5@gmail.com> |
|---|---|
| Newsgroups | comp.theory |
| Subject | Re: Proof that the halting problem itself is a category error |
| Date | 2025-12-11 06:58 +0800 |
| Organization | A noiseless patient Spider |
| Message-ID | <a3bcd46bf5b5a3ccc4b1308d8c7065008c1b4092.camel@gmail.com> (permalink) |
| References | <10hct1p$1d92l$1@solani.org> |
On Wed, 2025-12-10 at 16:43 -0600, polcott wrote:
> When the halting problem requires a halt decider
> to report on the behavior of a Turing machine
> this is always a category error.
>
> The corrected halting problem requires a Turing
> machine decider to report in the behavior that
> its finite string input specifies.
If you honestly admit you are solving POO Problem, everything is fine.
See my General HP. If the MSet is TM, then the halting decider cannot exist.
https://sourceforge.net/projects/cscall/files/MisFiles/ghp.txt/download
> This analysis in done in the C programming language
> so that it is 100% concrete without any key details
> being abstracted away.
>
> int DD()
> {
> int Halt_Status = HHH(DD);
> if (Halt_Status)
> HERE: goto HERE;
> return Halt_Status;
> }
>
> (a) The key issue is that HHH(DD) does report on the
> behavior that its input finite string specifies.
>
> (b) Reporting on anything else is outside of the
> scope of Turing Machine Computable functions.
>
>
> *Detailed analysis shown below*
>
> After many very extensive discussions with LLM
> systems there are two principles that prove that
> I have correctly refuted the halting problem itself.
>
> (1) Turing Machine based Computable functions
> only transform input finite strings into some value
> on the basis of a semantic of syntactic property
> that this finite string specifies.
>
> (2) the behavior that an input DD specifies to halt
> decider HHH is the sequence of steps of DD
> simulated by HHH according to the semantics of
> the C programming language.
>
> Computable functions are the basic objects of study
> in computability theory. Informally, a function is
> computable if there is an algorithm that computes
> the value of the function for every value of its argument.
> https://en.wikipedia.org/wiki/Computable_function
>
> DD() executed from main() calls HHH(DD) thus is
> not one-and-the-same-thing as an argument to HHH.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar
Proof that the halting problem itself is a category error polcott <polcott333@gmail.com> - 2025-12-10 16:43 -0600
Re: Proof that the halting problem itself is a category error wij <wyniijj5@gmail.com> - 2025-12-11 06:58 +0800
Re: Proof that the halting problem itself is a category error polcott <polcott333@gmail.com> - 2025-12-10 17:03 -0600
Re: Proof that the halting problem itself is a category error wij <wyniijj5@gmail.com> - 2025-12-11 07:11 +0800
Re: Proof that the halting problem itself is a category error polcott <polcott333@gmail.com> - 2025-12-10 17:42 -0600
Re: Proof that the halting problem itself is a category error --- typo polcott <polcott333@gmail.com> - 2025-12-10 17:53 -0600
Re: Proof that the halting problem itself is a category error olcott <polcott333@gmail.com> - 2025-12-11 17:12 -0600
Re: Proof that the halting problem itself is a category error Richard Damon <Richard@Damon-Family.org> - 2025-12-10 21:13 -0500
Re: Proof that the halting problem itself is a category error Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-12-12 01:56 +0000
Re: Proof that the halting problem itself is a category error olcott <polcott333@gmail.com> - 2025-12-11 20:02 -0600
csiph-web