French computer scientists have finally proved that sorting pancakes is hard  NP hard.
No really  this isn't a joke. Well, it is slightly amusing but that's just because it is being presented as pancake flipping. The algorithm in question is sorting a permutation using prefix reversal  which is much easier to understand in terms of pancakes.
Pancake flipping is a longstanding algorithmic problem.
You start with a stack of pancakes of different sizes and your task is to sort them into order. The only restriction, and this is what makes it difficult, is that you can't touch them with anything but your spatula. All you can do is insert your spatula at a division point and flip the entire set of pancakes you have picked up upside down in one operation.
There is a variant on the problem where you have burned all the pancakes on one side and you have to finish the sort with all the burned sides face down.
The question to be answered in both cases is, if the stack has n pancakes, what is the maximum number of flips needed as a function of n, i.e. f(n)?
In short, what is the computational complexity of the pancake problem?
At the moment we only know f(n) for n<=19 (for the burnt version of the problem we only know it for n<=17). Apart from this we know a few general upper and lower bounds but these aren't thought to be particularly tight.
Now a team of three computer scientists from Laboratoire d'Informatique de NantesAtlantique have succeeded in proving that the pancake problem is NP hard. Roughly stated, this makes the problem at least as hard as the hardest in the NP class. What this means is that if you can find a polynomial time solution to the pancake problem then you have proved that P=NP.
The paper doesn't improve the bounds on the complexity function, but it has managed to show that proving that a known lower bound  the number of breakpoints  is a tight lower bound, is also NP hard.
The algorithm does have some practical purposes  in comparative genomics for example, and there is an even more useful related problem of sorting by reversal.
But who needs practical applications to be interested in pancakes?
More Information
Pancake Flipping is Hard arXiv:1111.0434v1
Related articles on I Programmer
Computational Complexity
Computability
To be informed about new articles on I Programmer, subscribe to the RSS feed, follow us on Twitter or Facebook or sign up for our weekly newsletter.
More Ties Than We Thought Or Ties Of The Matrix 26/03/2014
The Matrix Reloaded started something when "The Merovingian" wore a number of very flashy ties. The problem was that we thought we knew how many ways you can tie a tie, but the enumeration didn't incl [ ... ]

Google Fool's Day 01/04/2014
Google's tradition of taking April Fool's Day seriously is so well known that wait wait expectantly to see what it will come up with each year. In particular what is there for developers?
 More News 
