(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.

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.

(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.

(object-oriented programming) The problematic situation where a base class contains methods which mutate an object in a manner which may invalidate a (stronger) invariant found in a derived class, violating the Liskov substitution principle. For example, if a circle is modelled as a subtype of an ellipse, and the ellipse has a method that stretches it on one axis, the circle must also implement that method despite it making no sense for a circle.

In decision theory, a kind of puzzle in which whenever an ideally rational epistemic agent is awoken from sleep, it has no memory of whether it has been awoken before. Upon being told that it has been woken once or twice according to the toss of a coin, once if heads and twice if tails, it is asked its degree of belief for the coin having come up heads.