Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Newsgroups | comp.theory, comp.ai.philosophy, sci.logic, sci.math |
| Subject | Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function |
| Date | 2021-09-27 12:53 -0600 |
| Organization | A noiseless patient Spider |
| Message-ID | <sit40a$upf$1@dont-email.me> (permalink) |
| References | (13 earlier) <6u6dnRt6pveUTsz8nZ2dnUU7-VednZ2d@giganews.com> <sistkb$dr5$1@dont-email.me> <IZudnYjB1fr4n8_8nZ2dnUU7-X_NnZ2d@giganews.com> <sit150$9ge$1@dont-email.me> <J8udneU4C5mSk8_8nZ2dnUU7-cXNnZ2d@giganews.com> |
Cross-posted to 4 groups.
On 9/27/2021 12:31 PM, olcott wrote:
<CRAP SNAP>
> This is the key basis of my refutation of the halting theorem:
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
>
> I presented this to Ben more than four years ago and he successfully
> changed the subject with various dishonest dodges so that it could not
> be properly evaluated until now.
>
> Infinitely Recursive input on HP Proofs
> peteolcott
> Mar 11, 2017, 3:13:03 PM
> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
>
> All of the "rebuttals" have taken the form of the strawman error:
> The halting theorem does not specify a simulating halt decider.
> This is no actual rebuttal to the original claim at all.
No one but you has been dishonest. And that is a two decade truth. If
Martin Davis or Peter Lintz said they now had doubt of the halting
theorem, the world would be excited. We would expect to learn something
new about model theory or a new theory of computation. Also, most of us
would be a little sad: Since this was an extremely well pawed over area,
we would expect the insight to occur at such a deep level that we may or
may not be able to enjoy it either through lack of ability or of
knowledge at the state of the art. You, on the other hand are repeating
problems first discussed and analyzed by the pre Greeks. Today, the liar
paradox is for the amusement of school children, not logicians or
mathematicians. You are several thousand years late. The issues which
drive you are the stuff of Penny Problem Solver collections. There is a
book called "What is the name of this book?". Get a copy and read it
while there is time.
In any event, stop this childish repetition of non sense. Give adulthood
a chance. We are not all destined for fame and immortality for our brain
power. It's certain you are not. Even if your brain was adequate to do
world class work, your personality disorders disqualify you. You refuse
to listen, you refuse to learn, and you throw constant tantrums. The
technical world is much too sophisticated for a genius to walk in off
the streets and present a new earth shaking method to bake bread, let
alone do a new computation theory. You really do need to study more and
learn from the masters.
Your current plan has made you appear (and be) a classic case of
ignorance morphed into stupidity. You need to grow up.
Jeff Barnett
Back to sci.math | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-26 13:28 -0500
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-27 12:41 -0500
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function Jeff Barnett <jbb@notatt.com> - 2021-09-27 12:05 -0600
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-27 13:31 -0500
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function Jeff Barnett <jbb@notatt.com> - 2021-09-27 12:53 -0600
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-27 14:07 -0500
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-27 15:44 -0500
Re: It looks like I can exactly duplicate the Linz proof in C/x86 as a pure function olcott <NoOne@NoWhere.com> - 2021-09-27 22:28 -0500
csiph-web