I was referring to the content of the "encrypted" text not to the time at which the post was made. Me thinks you may be taking this a bit seriously.:-)
Arguments to instructions in this most basic of instructions sets are stored in the opcodes themselves and therefore are already included in the numbers i cited. same as doing adds and subs on x86 with constant values. the constants are included in the opcode value in memory and so don't need a separate calculation.
Slashdot Mirror
I was referring to the content of the "encrypted" text not to the time at which the post was made. Me thinks you may be taking this a bit seriously. :-)
Justin Dubs
A clever first post indeed...
Arguments to instructions in this most basic of instructions sets are stored in the opcodes themselves and therefore are already included in the numbers i cited. same as doing adds and subs on x86 with constant values. the constants are included in the opcode value in memory and so don't need a separate calculation.
I wish. Here are a few numbers for ya:
16 possible instructions. 40 in memory.
That's 16^40 = 1.46 x 10^48 combinations.
Now, let's assume that we have a computer than can generate 1 billion of these per second.
That's 1.46 x 10^39 seconds.
Okay, we have 1 billion of those computers.
That's 1461.5 billion billion billion seconds.
That's 46.3 billion billion millenia.
Ouch.
Justin Dubs
And as long as you never have to type
./configure
make; make install
It's a good enough OS for everyone else.
Justin Dubs