Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #2532

Re: Theorem automated proving P = NP A proposition

Cross-posted to 3 groups.

Show all headers | View raw

Jan Burse wrote:
> 
>  > (** QED stands for "Quid erst demonstration". This = Latin for "What
>  > was to be shown." *)
> 
> The above doesn't sound latin, but I am not
> an expert. I find instead:
> 
> quod erat demonstrandum
> quod esset demonstrandum
> http://de.wikipedia.org/wiki/Quod_erat_demonstrandum
> 
> And humorously:
> quo errat demonstrator
> quod est dubitandum

I had a teacher who claimed it stood for "quite easily done".

-- 
When a true genius appears in the world, you may know him by 
this sign, that the dunces are all in confederacy against him.
Jonathan Swift: Thoughts on Various Subjects, Moral and Diverting

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Theorem automated proving P = NP A proposition Martin Musatov <marty.musatov@gmail.com> - 2012-11-28 04:59 -0800
  Re: Theorem automated proving P = NP A proposition Jongware <jongware@no-spam.plz> - 2012-11-28 14:43 +0100
  Re: Theorem automated proving P = NP A proposition Jan Burse <janburse@fastmail.fm> - 2012-11-28 15:11 +0100
    Re: Theorem automated proving P = NP A proposition Frederick Williams <freddywilliams@btinternet.com> - 2012-11-28 14:39 +0000
      Re: Theorem automated proving P = NP A proposition Martin Musatov <marty.musatov@gmail.com> - 2012-11-28 12:51 -0800

csiph-web