not my problem

  • 101Year 2000 problem — Y2K redirects here. For other uses, see Y2K (disambiguation). The (French) sign reads 3 January 1900 instead of 3 January 2000 The Year 2000 problem (also known as the Y2K problem, the Millennium bug, the Y2K bug, or simply Y2K) was a problem for …

    Wikipedia

  • 102P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …

    Wikipedia

  • 103Gettier problem — A Gettier problem is a problem in modern epistemology issuing from counter examples to the definition of knowledge as justified true belief (JTB). The problem owes its name to a three page paper published in 1963, by Edmund Gettier, called Is… …

    Wikipedia

  • 104Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …

    Wikipedia

  • 105Transformation problem — In 20th century discussions of Karl Marx s economics the transformation problem is the problem of finding a general rule to transform the values of commodities (based on labour according to his labour theory of value) into the competitive prices… …

    Wikipedia

  • 106Chess problem terminology — This is a list of terms used in chess problems. For a list of unorthodox pieces used in chess problems, see fairy chess piece. For a list of terms used in chess is general, see chess terminology. NOTOC A *Actual play see post key play . *Albino a …

    Wikipedia

  • 107Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… …

    Wikipedia

  • 108Demarcation problem — The demarcation problem (or boundary problem[1]) in the philosophy of science is about how and where to draw the lines around science. The boundaries are commonly drawn between science and non science, between science and pseudoscience, between… …

    Wikipedia

  • 109Future Problem Solving Program International — The Future Problem Solving Program International (FPSPI), formerly known as the Future Problem Solving Program (FPSP), is an international academic competition. Over 250,000 students internationally participate in the Future Problem Solving… …

    Wikipedia

  • 110Classical central-force problem — In classical mechanics, the central force problem is to determine the motion of a particle under the influence of a single central force. A central force is a force that points from the particle directly towards (or directly away from) a fixed… …

    Wikipedia