|
![](/i/fill.gif) |
Warp wrote:
> Invisible <voi### [at] dev null> wrote:
>> On the other hand, according to my sums 10^80 is roughly 2^266. Thus,
>> the binary chop algorithm requires only 266 operations, and can easily
>> complete the entire process in well under a second. [If we assume
>> completely random access to any atom in the universe, which completely
>> defies several known physical laws...]
>
> It would require for the atoms to be sorted in a specific order.
> How would you sort them?
Clearly by the value of the time component of the space-time event where
the atom currently exists. ;-)
--
Darren New / San Diego, CA, USA (PST)
Post a reply to this message
|
![](/i/fill.gif) |