For more than a decade, no single issue has caused more frustration or curiousity for Python novices and experts alike than the Global Interpreter Lock.
An Open Question
Every field has one. A problem that has been written off as too difficult, too time consuming. Merely mentioning an attempt to solve it raises eyebrows. Long after the community at large has moved on, it is taken up by those on the fringe. Attempts by novices are undertaken for no other reason than the difficulty of the problem and the imagined accolades that would accompany a solution. The open question in Computer Science of whether P = NP is such a problem. An answer to the affirmitive has the possibility to literally change the world, provided a “reasonable” polynomial time algorithm is presented. Python’s hardest problem is less difficult than crafting a proof of P = NP, to be sure. Nevertheless, it has not received a satisfactory solution to date, and the practical implications of a solution would be similarly transformative. Thus, it’s easy to see why so many in the Python community are interested in an answer to the question: “What can be done about the Global Interpreter Lock?”
