Episode III, An Implementation of Shuffling
We created this file to test if hardware permits, if it is possible to generate a permutation of one G first G of nature numbers.
Test shows for e=30 in a single-thread mode, i7 level CPU, it took about two minutes to complete the program.
Yeh, but I am not a little bit greedy. Now I want to generate a random permutation of one T, T is 1024*G, numbers of the first T of Nature numbers, even the random is pseudo-. How can we achieve this? Or, can we achieve this with e.g. a 6-G mem laptop?
There is definitely third party material involved. Zhikai will try his best to source the materials presented. But there may still be un-intentionally neglegance, insufficient documentation, improvised convenience copy introduced line-by-line string/text matched etc. Please understand that this site is just demonstrating the willingness of the builder to contribute to and promote the advancement of science and technology.
You are welcome to challenge the originality, claim license/copyright violation or point out fallacies, mistakes, un-founded-ness, seriousness-deficiency, e.g. April 1st technotes, etc. At this point, please present sound proof, prior arts etc.
For all materials at this site, all applicable licenses/rights are automatically cascaded to them from their bases. So far www.heteroclinic.net is not a commercial website so there is no economic or virtual damage to be acknowledged. Anything you want to put to commercial purpose, Zhikai is willing help you to resovle all the rights, licenses etc.
If you are interested in getting some of the source code not built together with the binaries, please contact Zhikai.
Episode II, a list of exercises
-- March 22, 2013
A list of exercises during the development of Recursive Random Bit Flip Permutation:
Episode IV, we forward G to T, T is 1024*G
Recursive Random Bit Flip Permutation
-- March 22, 2013
A pair of sharp eyes may already see through and catch a big hole of Recursive Random Bit Flip Permutation, but to fill the hole would seem to be easier.
It took longer time to imagine the bit-flip method. Shorter time (two or three) days finding the hole. Even shorter to imagine a way to fill the hole.
As of today, everything is still imagination, Mar 19, 2013.
In this episode, I meant to close the depth peeling transparency project and I will open the code. But I forgot to bring the code four years ago with my travel.