Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.software-eng > #2707
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Newsgroups | comp.theory, comp.ai.philosophy, comp.software-eng, sci.math.symbolic |
| Subject | Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(V2) |
| Message-ID | <20210520190726.000037df@reddwarf.jmc> (permalink) |
| References | <Y7adnVlvwpWdBTv9nZ2dnUU7-QfNnZ2d@giganews.com> |
| Organization | Jupiter Mining Corp |
| Date | 2021-05-20 19:07 +0100 |
Cross-posted to 4 groups.
On Thu, 20 May 2021 12:11:14 -0500
olcott <NoOne@NoWhere.com> wrote:
> This is a {clarification, correction and simplification} of the Peter
> Linz text:
[snip]
>
> Conclusion:
> Ĥ is a halting computation and its input is not a halting computation
> therefore Ĥ decides its input [Ĥ] as non-halting correctly.
Conclusion:
Truisms by definition are self evidently true so if you are having to
explain truisms then Occam's Razor suggests that they are not in fact
truisms and you are barking up the wrong tree. Also, you haven't
refuted Turing until you address the issue of branching logic
predicated on arbitrary program input.
/Flibble
Back to comp.software-eng | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(V2) olcott <NoOne@NoWhere.com> - 2021-05-20 12:11 -0500
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(V2) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-20 19:07 +0100
Re: Halting theorem refutation (Three irrefutable truisms lead to one conclusion)(V2)[ Truism(2) ] olcott <NoOne@NoWhere.com> - 2021-05-20 13:36 -0500
csiph-web