Search results

The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal...

species were fixed and clearly distinct from one another, there would be no problem, but evolutionary processes cause species to change. This obliges taxonomists...

The term year 2000 problem, or simply Y2K, refers to potential computer errors related to the formatting and storage of calendar data for dates in and...

mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for...

Problem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from...

Unsolved problem in computer science: If the solution to a problem is easy to check for correctness, must the problem be easy to solve? (more unsolved...

The year 2038 problem (also known as Y2038, Y2K38, Y2K38 superbug, or the Epochalypse) is a time computing problem that prevents some computer systems...

the darkness during the morning due to late sunrises. Some clock-shift problems could be avoided by adjusting clocks continuously or at least more gradually—for...

The problem of evil is the philosophical question of how to reconcile the existence of evil and suffering with an omnipotent, omnibenevolent, and omniscient...

question of the precise nature of their literary relationship—the synoptic problem—has been a topic of debate for centuries and has been described as "the...

In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances...

computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem is a task...

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the...

In physics, specifically classical mechanics, the three-body problem is to take the initial positions and velocities (or momenta) of three point masses...

largest (or smallest) value if such a point exists. Linear programs are problems that can be expressed in standard form as Find a vector x that maximizes...

set must be found. They can include constrained problems and multimodal problems. An optimization problem can be represented in the following way: Given:...

computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes"...

, some boundary value problems). There are also studies about using FEM to solve high-dimensional problems. To solve a problem, FEM subdivides a large...

Problem gambling, ludopathy or ludomania is repetitive gambling behavior despite harm and negative consequences. Problem gambling may be diagnosed as a...

computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time...