Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4091
| From | computer45 <computer45@cyber.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | I will provide you with a more rigorous logical proof.. |
| Date | 2018-03-20 00:00 -0400 |
| Organization | A noiseless patient Spider |
| Message-ID | <p8pivm$nmb$8@dont-email.me> (permalink) |
Hello.. Read this: I will provide you with a more rigorous logical proof.. You have seen me before proving to you my scalable reference counting algorithm that i have "invented" and i have debugged it and i think it is working correctly, but I will provide you with a more rigorous logical proof soon and i will include it on the zip file, so that i will perhaps sell it to Embarcadero and to other software companies. I am still inventing scalable algorithms and other algorithms. My next invention is a FIFO queue that is waitfree on the producer side and that is lockfree on the consumer side and that will use my new scalable reference counting. So stay tuned my algorithm inventions and there implementations are coming soon. Thank you, Amine Moulay Ramdane,.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
I will provide you with a more rigorous logical proof.. computer45 <computer45@cyber.com> - 2018-03-20 00:00 -0400
csiph-web