Tag: quantum computing
-
Time-Efficient Shuffling
Dan proposes a more complexity-efficient alternative to the Fisher-Yates shuffling algorithm. And it's silly.
-
The Case Against Quantum Computing
by Mikhail Dyakonov Quantum computing is all the rage. It seems like hardly a day goes by without some news outlet describing the extraordinary things this technology promises. Most commentators forget, or just gloss over, the fact that people have been working on quantum computing for decades—and without any practical results to show for it.
We’ve …