plural of candy store problem

plural of Sleeping Beauty problem

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

plural of Behrens-Fisher problem

(statistics) The problem of interval estimation and hypothesis testing concerning the difference between the means of two normally distributed populations when the variances of the two populations are not assumed to be equal, based on two independent samples.

Synonym of boy or girl paradox

Synonym of boy or girl paradox

A puzzle of this kind: "You are given two indistinguishable envelopes, each containing money; one contains twice as much as the other. You may pick one envelope and keep the money it contains. Having chosen an envelope at will, but before inspecting it, you are given the chance to switch envelopes. Should you switch?" Because you stand to gain twice as much money if you switch while risking only a loss of half of what you currently have, it is possible to argue (fallaciously) that it is beneficial to switch.

(graph theory) The problem of finding the longest possible induced path in a hypercube.