Supercomputer and encryption and compression @ rate of 96%
The bit sent would be 0 and the key code would be F1-24,k 1-24, I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new encryption you could encrypt or compress 100 terabits down to 1 bit of information. Now if you take this idea from my web site you could make this allot more complex and unbreakable. Data encryption 360 degrees rotation document 90 degrees and encrypt on every angel then 45 degrees change it two binary code do it again and again and fold it over like a piece of paper then having the one's and zero cancel each other out. In theory you could send a 100 terabit program to someone's computer and have it unzip and run and install or make A computer processor like the new 64 bit AMD have the bit unzip into a large ram drive and buffer use one half of the 64 bit processor decode the message and the main 64 bit run the numbers. Another way of doing this is to have a parallel computers with using one of the processes run the compressed 1 bit of information give the uncompressed a address on the ram drive to change and not even go threw the processor and then with different information on each machine compare and run statistics on information on a 45 tflops supercomputer and turn that 45 tflops computer into a 1 bit = 100,000 terabits to infinite as long as you have the ram for storage! with my calculations 45 tflops wouldn't matter any more it would be how much data you have on a 32bit operating system changing that to a 1 bit system it would be 32 * 45tflops would = 1440 tflops Matter moves so fast that it intergreats and deintergreats faster then any speed we can see it like water from a hose at real close speed it moves in -------- lines.
Please implement this as a Python module. I would like to compress my mp3 collection to single bits.
Will McGugan
--
http://www.willmcgugan.com
"".join( [ {'*':'@','^':'.'}.get(c,None) or chr(97+(ord(c)-84)%26) for c in "jvyy*jvyyzpthtna^pbz" ] )
--
http://mail.python.org/mailman/listinfo/python-list