This allows "algorithms" like this:
for x in [0...VA.length]
while (VA.get(x) > x)
VA.swap(VA.get(x), x)36 karma · joined June 11, 2009
This allows "algorithms" like this:
for x in [0...VA.length]
while (VA.get(x) > x)
VA.swap(VA.get(x), x)The only gripe i had with it was that it required typing two spaces after a period. I found this just plain weird, so I fixed it in the tutorial files.
I guess using a blank keyboard also helped quite a bit..
That's actually what they are already doing when pitching new drugs to doctors. Now they only have to convince the system designers and not thousands of practicing doctors.
What's nice about it is that it is deterministic yet ridiculously slow.
It can also be really easily implemented in Prolog[1] where you simply define what a permutation and being sorted means. After that you just search for a sorted permutation.
[1] http://rosettacode.org/wiki/Sorting_algorithms/Permutation_s...
It could work by writing a specific pattern in the first few bytes of the device and then reading/writing in 2^n steps to check if the pattern cycles.
I think I have some counterfeit thumb-drives lying around. Maybe I will try writing something like that..
I guess that this would need distilled water anyway.
For now, I have to use a self-compiled 2.6 python package. I have locked the python and python2 packages from further updates for now. I hope this situation get better soon.
You can find all reconstructed images here: http://www.loc.gov/exhibits/empire/
All the number-play in the article is completely pointless.
$ time python fib.py 40
102334155
real 0m0.013s
user 0m0.000s
sys 0m0.010s