(computing theory) A problem of interprocess communication and synchronization where one process responds to requests from multiple other threads and sleeps when not doing so. In some cases this may lead to an undesirable state where components are waiting for each other despite being ready.

A proposal that does not solve any problem or provide any value; or one that is intended to fill a need which does not really exist.

plural of solution in search of a problem

Alternative spelling of travelling salesman problem

Alternative spelling of travelling salesman problem

Alternative spelling of travelling salesman problem

(graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.

plural of Chinese postman problem

(mathematics) A mathematical problem where one must determine how many grains of wheat are on a chessboard, assuming one grain of wheat is placed on the first square, and each subsequent square having twice as many grains of wheat as the previous square.

The problem of having too many options available.