On Friday, December 2, 2005 at 3:02:59 PM UTC-2, Cyce wrote:
Dear Sir,
You find my range of values funny...
I take it you don't believe it's possible, if this is the case could
you please explain from your point of view why this is so.
If your basis is the counting problem let me quash that silly, but true statement.
The counting problem is true in that the number of finite states within
a certain range is less than the number of infinite states.
The counting problem, however falsely implies that a small number of
states can't reproduce a larger number of states.
I will use an example based on something not under the NDA, since I use
other methods.
256^256 = 3.231700607131100730071487668867e+616 : 1-byte=>1-byte =>
many bytes
A simple example that demonstrates how two small values can combine to
form a larger value. You may argue that it's only one state and this
is true, however if you look at the range of the first and the range of
the second byte there are 65,536 states. The counting argument is
broken when you include cross referenced meaning, as in the above
example, combined with recursive manipulation and disclude the infinite range.
ie the truth is only as true as the next truth The difference between
the earth being round and the earth being flat is not far apart mathematically and neither is true, the earth is neither round nor
flat, but both and neither.
If you have any other reason why my statements may be wrong I'd love to
hear your thoughts on the matter so that I may verify them and the
accuracy of my program,
Cyce
Hello Cyce, are you still there? I did come across a limitless data compression system on my own. Are you willing to start a conversation?
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)