(object-oriented programming) The ambiguity that arises when two classes B and C inherit from A, and a further class D inherits from both B and C, so that if there is a method in A that B and/or C has overridden, and D does not override it, it is unclear which version of the method D should inherit.

(cellular automata) The problem of finding one-dimensional cellular automaton rules that accurately perform majority voting.

(philosophy) The difficulty of using statistical probability to evaluate the plausibility of a statement such as "the sun will rise tomorrow" based only on prior observations.

Synonym of Newcomb's paradox

An urge to gamble continuously despite negative consequences or a desire to stop.

(computing) In multithreaded computing, when a program mistakenly considers equality of a variable at two times to mean it has never changed in between.

The need to make a decision between alternatives that are both desirable.

The situation where a spam filter or search engine blocks or modifies content because the text contains a string of letters shared with an obscene word.

plural of fencepost problem

plural of problem child