Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #143566
| Newsgroups | comp.lang.c |
|---|---|
| Date | 2019-05-02 00:45 -0700 |
| References | (19 earlier) <lnsgtyvzfh.fsf@kst-u.example.com> <8JadnV4tzcaXcFTBnZ2dnUU7-eHNnZ2d@giganews.com> <qad31d$tn5$1@dont-email.me> <e6OdnRYAM5u6jlfBnZ2dnUU7-dXNnZ2d@giganews.com> <qae5md$en8$1@dont-email.me> |
| Message-ID | <bb1e0e84-3066-4e5d-b280-e2c09e3a46c8@googlegroups.com> (permalink) |
| Subject | Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) |
| From | mark.bluemel@gmail.com |
On Thursday, 2 May 2019 08:19:56 UTC+1, David Brown wrote:
> On 01/05/2019 23:44, peteolcott wrote:
> > On 5/1/2019 4:28 PM, David Brown wrote:
> >> On 01/05/2019 21:01, peteolcott wrote:
> >>> On 5/1/2019 12:48 PM, Keith Thompson wrote:
> >>>> peteolcott <Here@Home> writes:
> >>>> [...]
> >>>>
> >>>> One last try.
> >>>>
> >>>> Pete, as far as I can tell you have written nothing relevant to
> >>>> C, C++, or Lisp. Please stop posting in comp.lang.{c,c++,lisp}.
> >>>> (I would have emailed you if you had provided a valid email address.)
> >>>>
> >>>> I do not intend to post again in this thread.
> >>>>
> >>>
> >>> You have been proven to be incorrect in that people continue to
> >>> respond. It is most relevant to Prolog, it is next most relevant
> >>> to Lisp because Lisp is an AI language. I might drop C++, and C
> >>> off the list of cross-posts.
> >>>
> >>
> >> Please do drop C and C++ groups. I can't answer for prolog or lisp
> >> groups, as I do not follow these. But I note that everyone else in
> >> your threads - baring those like me who are complaining - has dropped
> >> the C and C++ groups. Thus all we see are endless posts from you,
> >> apparently replying to yourself, and with no content of any interest
> >> to our groups. It may be that you have discovered some important
> >> result in formal systems, but we in the C and C++ groups are not
> >> interested. (If anyone from these groups disagrees with me, please
> >> say so.)
> >>
> >>
> >
> > I used to talk about this on comp.theory and then comp.theory died:
> >
>
> Why am I not surprised? Posters like you kill groups.
>
> If you ever get as far as working on a C++ implementation and want to
> discuss coding details, come back here. Until then, please stay out of
> irrelevant groups.
I'm afraid that in the same way as Christianity is relevant everywhere for
Rick, and Fir's posts fulfill the role that a blog would fulfill for a sane
person, Mr Olcott sees his babblings about his pet theory as relevant
everywhere. As with Rick and Fir, there's little value in engaging with
him.
As we can't take off and nuke from orbit, I suggest that those of us who
can do so might deploy suitable killfiles.
Back to comp.lang.c | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-26 09:58 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Siri Cruise <chine.bleu@yahoo.com> - 2019-04-26 08:20 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-26 10:48 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-26 10:51 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Kaz Kylheku <847-115-0292@kylheku.com> - 2019-04-26 17:48 +0000
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-26 17:22 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Kaz Kylheku <847-115-0292@kylheku.com> - 2019-04-27 01:13 +0000
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 11:23 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Kaz Kylheku <847-115-0292@kylheku.com> - 2019-04-27 18:26 +0000
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Ike Naar <ike@iceland.freeshell.org> - 2019-04-27 21:56 +0000
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 17:13 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 16:58 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 17:28 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 17:44 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 17:49 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 18:59 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 19:44 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 19:48 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-27 21:38 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-29 21:53 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-30 11:55 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-30 12:02 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) bert <bert.hutchings@btinternet.com> - 2019-04-30 11:06 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 00:51 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) bert <bert.hutchings@btinternet.com> - 2019-05-01 03:21 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 07:50 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 09:29 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 13:53 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Keith Thompson <kst-u@mib.org> - 2019-05-01 10:48 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Bonita Montero <Bonita.Montero@gmail.com> - 2019-05-01 20:25 +0200
Re: Eliminating Undecidability and Incompleteness in Formal Systems (HP Proof refutation) peteolcott <Here@Home> - 2019-05-01 15:01 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 14:01 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) David Brown <david.brown@hesbynett.no> - 2019-05-01 23:28 +0200
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 16:44 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) David Brown <david.brown@hesbynett.no> - 2019-05-02 09:19 +0200
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) mark.bluemel@gmail.com - 2019-05-02 00:45 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-05-02 09:56 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-02 09:58 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 15:14 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-29 18:43 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-04-29 22:06 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-01 15:10 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Richard Damon <Richard@Damon-Family.org> - 2019-05-04 15:05 -0400
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) peteolcott <Here@Home> - 2019-05-04 15:07 -0500
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Keith Thompson <kst-u@mib.org> - 2019-04-26 19:43 -0700
Re: Eliminating Undecidability and Incompleteness in Formal Systems (Prolog already does this) Bonita Montero <Bonita.Montero@gmail.com> - 2019-05-01 17:56 +0200
csiph-web