Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #8522
| From | David Brown <david.brown@hesbynett.no> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: I will provide you with a more rigorous logical proof.. |
| Date | 2018-03-21 13:28 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <p8tj5c$uic$1@dont-email.me> (permalink) |
| References | <p8piv7$nmb$7@dont-email.me> <825fb3d0-c2df-483b-8779-b9dc71327180@googlegroups.com> <5ab169f1$0$5152$e4fe514c@textnews.kpn.nl> <d2912820-7e1e-4399-96f1-8e4efdc515a0@googlegroups.com> <5ab172c3$0$5163$e4fe514c@textnews.kpn.nl> |
On 20/03/18 21:44, Sjouke Burry wrote: > On 20-3-2018 21:25, Chad wrote: >> On Tuesday, March 20, 2018 at 1:07:58 PM UTC-7, Sjouke Burry wrote: >>> On 20-3-2018 19:28, Chad wrote: >>>> Well that pretty much narrows it down to like how many types of math >>>> proofs used in programming? The one I know are proof by Induction >>>> and proof by contradiction. I've also done some proofs that involve >>>> both necessary and sufficient conditions. >>>> >>>> And there is also a class of proofs that involve using >>>> delta/epsilon. I'm that that sure what the formal name of it though. >>>> It is similar to the first part of proof by Induction in that it >>>> involves using algebra for the hypothesis. But after that, it >>>> diverges to using universal quantifiers. >>>> >>>> Omfg, I'm not versed like you. My excuse is that I'm a programmer >>>> and not a genius that spams this forum with the same recycled crap. >>>> >>> You think you can educate a 20 year long addict to >>> daily trolling? >>> >> >> I would, but I've seen like three marginally interesting posts by this >> person. Which of his posts are of even marginal interest? I suppose it could happen that occasionally he will write something interesting. After all, /you/ managed to make several posts in a row that were not obscene, chauvinist or part of a meaningless flame war. >> > He changes his nym(now computer45), > and talks and answers his own questions. What bugs me most is the absurd creation of new "Read again, I correct" threads to post the same thing again and again with nothing but a negligible spelling correction.
Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
I will provide you with a more rigorous logical proof.. computer45 <computer45@cyber.com> - 2018-03-20 00:00 -0400
I will provide you with a more rigorous logical proof.. Chad <cdalten@gmail.com> - 2018-03-20 11:28 -0700
Re: I will provide you with a more rigorous logical proof.. Richard Heathfield <rjh@cpax.org.uk> - 2018-03-20 18:42 +0000
Re: I will provide you with a more rigorous logical proof.. cross@spitfire.i.gajendra.net (Dan Cross) - 2018-03-20 20:00 +0000
Re: I will provide you with a more rigorous logical proof.. David Brown <david.brown@hesbynett.no> - 2018-03-21 13:22 +0100
Re: I will provide you with a more rigorous logical proof.. cross@spitfire.i.gajendra.net (Dan Cross) - 2018-03-20 20:02 +0000
Re: I will provide you with a more rigorous logical proof.. Chad <cdalten@gmail.com> - 2018-03-20 13:23 -0700
Re: I will provide you with a more rigorous logical proof.. Sjouke Burry <burrynulnulfour@ppllaanneett.nnll> - 2018-03-20 21:07 +0100
Re: I will provide you with a more rigorous logical proof.. Chad <cdalten@gmail.com> - 2018-03-20 13:25 -0700
Re: I will provide you with a more rigorous logical proof.. Sjouke Burry <burrynulnulfour@ppllaanneett.nnll> - 2018-03-20 21:44 +0100
Re: I will provide you with a more rigorous logical proof.. David Brown <david.brown@hesbynett.no> - 2018-03-21 13:28 +0100
Re: I will provide you with a more rigorous logical proof.. Chad <cdalten@gmail.com> - 2018-03-22 08:19 -0700
Re: I will provide you with a more rigorous logical proof.. Richard Heathfield <rjh@cpax.org.uk> - 2018-03-22 18:13 +0000
csiph-web