Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
I will provide you with a more rigorous logical proof..
0 views
Skip to first unread message
computer45
Mar 19, 2018, 8:00:56 PM3/19/18
to
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,.
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,.
0 new messages