News for hackers. Stuff that matters.
Re:Bogo-bogosort by fragsworth on Saturday December 28, 2013 @08:02PM (#6977536)
We both came up with nearly the same idea at nearly the same time (within one minute) - what are the odds of that?

My solution is slightly different - to avoid the Halting Problem, you can use a distributed approach. You have a very large (but finite) number of processors that you pass your programs to.

Re:Bogo-bogosort by gcr on Saturday December 28, 2013 @10:09PM (#6978091)
Why not just pass it to an infinite number of processors and use a nondeterministic Turing machine?

But with an NDTM, even NP-complete problems can be solved within polynomial time.

Re:Bogo-bogosort by mikeash on Saturday December 28, 2013 @08:26PM (#6977675)
"what are the odds of that?"

I'm not sure, maybe we should build an unbelievably inefficient program to calculate them.

Re:Bogo-bogosort by elwell on Saturday December 28, 2013 @10:59PM (#6978290)
But is it really inefficient if it is efficient at being inefficient?