not my problem

  • 91induction, problem of — Problem of justifying the inductive inference from the observed to the unobserved. It was given its classic formulation by David Hume, who noted that such inferences typically rely on the assumption that the future will resemble the past, or on… …

    Universalium

  • 92Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… …

    Wikipedia

  • 93Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …

    Wikipedia

  • 94P versus NP problem — Unsolved problems in computer science Is P = NP ? …

    Wikipedia

  • 95Frame problem — In artificial intelligence, the frame problem was initially formulated as the problem of expressing a dynamical domain in logic without explicitly specifying which conditions are not affected by an action. John McCarthy and Patrick J. Hayes… …

    Wikipedia

  • 96Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …

    Wikipedia

  • 97Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… …

    Wikipedia

  • 98Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …

    Wikipedia

  • 99Chess problem — Part of a series on Puzzles …

    Wikipedia

  • 100Species problem — The species problem is a mixture of difficult, related questions that often come up when biologists identify species and when they define the word species .One common but sometimes difficult question is how best to decide just which particular… …

    Wikipedia