*promote

Promoting this video and sending it back into the queue for one more try; last queued Friday, September 23rd, 2011 7:13pm PDT - promote requested by Boise_Lib.

Well I use the chance to promote one of the newer sorting algorithms, which kind of use the "Quantum Suicide" principle. So here it is:
1. Shuffle your list randomly
2. If it's sorted now, stop.
3. If not, destroy the entire universe.

Reason: "Since the only survivors of this rather apocalyptic approach to computing will be in universes where the list was sorted after the first shuffle, it is quite efficient. Checking if a list is sorted requires n-1 comparisons, and I'm going to assume an entire universe can be destroyed in O(1), as it only ever has to happen once. Thus, bogosort becomes an O(n) sort algorithm."
http://www.mathnews.uwaterloo.ca/Issues/mn11103/QuantumBogoSort.php

Actually, Gwyneth Paltrow's head is in the box.

>> ^quantumushroom:

Actually, Gwyneth Paltrow's head is in the box.


But is she alive or dead?

Wrong. Alive or dead is not a quantum state.

>> ^syncron:

Wrong. Alive or dead is not a quantum state.

It is if the cat's being alive or dead is dependent on a quantum event: if the Geiger counter in the box detects radiation from the decay of the radiactive source, a mechanism will release the poison that kills the cat. In any case, Schroedinger intended his thought experiment to be a reductio ad absurdum of the Copenhagen interpretation of quantum mechanics, and he never intended to present the idea of cats in quantum superpositions as a real phenomenon. It's a satire.

Hey buttass!
My computer is so fast it can run an infinite loop in 2 seconds, so I don't need your damn optimized O(n) sorting algorithm!

>> ^luxury_pie:

Well I use the chance to promote one of the newer sorting algorithms, which kind of use the "Quantum Suicide" principle. So here it is:
1. Shuffle your list randomly
2. If it's sorted now, stop.
3. If not, destroy the entire universe.
Reason: "Since the only survivors of this rather apocalyptic approach to computing will be in universes where the list was sorted after the first shuffle, it is quite efficient. Checking if a list is sorted requires n-1 comparisons, and I'm going to assume an entire universe can be destroyed in O(1), as it only ever has to happen once. Thus, bogosort becomes an O(n) sort algorithm."
http://www.mathnews.uwaterloo.ca/Issues/mn11103/QuantumBogoSort.php

>> ^MonkeySpank:

Hey buttass!
My computer is so fast it can run an infinite loop in 2 seconds, so I don't need your damn optimized O(n) sorting algorithm!
>> ^luxury_pie:
Well I use the chance to promote one of the newer sorting algorithms, which kind of use the "Quantum Suicide" principle. So here it is:
1. Shuffle your list randomly
2. If it's sorted now, stop.
3. If not, destroy the entire universe.
Reason: "Since the only survivors of this rather apocalyptic approach to computing will be in universes where the list was sorted after the first shuffle, it is quite efficient. Checking if a list is sorted requires n-1 comparisons, and I'm going to assume an entire universe can be destroyed in O(1), as it only ever has to happen once. Thus, bogosort becomes an O(n) sort algorithm."
http://www.mathnews.uwaterloo.ca/Issues/mn11103/QuantumBogoSort.php





Fourth law of bogorobotics:
"Don't give it legs."
You failed sir and must now handle your running computer alone. Farewell.