Readers' corner And so to El Reg forums, where Julian Bradfield, an academic, writes:

In a vigorous discussion about revising courses in a computer science degree, one of my colleagues opined that "every decent programmer is sometime going to come across a task that is NP-hard, so they need to know to tackle NP-hard problems".

I'm curious as to whether anybody on here (who is a programmer after going through a so-called top university's computer science degree) has ever been asked to solve a task that is computationally intractable, and if so whether they used the last couple of decades' work on such things to solve it. Come to that, how many CS graduates ever solve algorithmic problems, rather than systems engineering problems?

Over to you, dear readers....

Also, why not start up your own thread. Just sign in to El Reg Forums, and get cracking. ®