Find link

The "No-Problem" Problem not in Sorting algorithm

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for The "No-Problem" Problem 549 found (172060 total)

alternate case: the "No-Problem" Problem

No problem (488 words) [view diff] no match in snippet view article find links to article

alternative to you're welcome, which shares the same function. In the culture of younger Americans, no problem is often used as a more conversational alternative
Monty Hall problem (8,898 words) [view diff] no match in snippet view article find links to article
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
Birthday problem (7,117 words) [view diff] no match in snippet view article find links to article
theory, the birthday problem asks for the probability that, in a set of n randomly chosen people, at least two will share the same birthday. The birthday
P versus NP problem (7,784 words) [view diff] no match in snippet view article find links to article
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 problems in
Problem of evil (17,943 words) [view diff] no match in snippet view article find links to article
The problem of evil is the philosophical question of how to reconcile the existence of evil and suffering with an omnipotent, omnibenevolent, and omniscient
No true Scotsman (850 words) [view diff] no match in snippet view article find links to article
No true Scotsman or appeal to purity is an informal fallacy in which one modifies a prior claim in response to a counterexample by asserting the counterexample
Computational complexity theory (6,704 words) [view diff] no match in snippet view article find links to article
decision problem—that is, the output is not just yes or no. Notable examples include the traveling salesman problem and the integer factorization problem. It
NP-completeness (3,618 words) [view diff] no match in snippet view article find links to article
NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the answer is "yes", this can be
Three-body problem (5,904 words) [view diff] no match in snippet view article find links to article
universal gravitation. Unlike the two-body problem, the three-body problem has no general closed-form solution, meaning there is no equation that always solves
Year 2000 problem (12,840 words) [view diff] no match in snippet view article find links to article
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
Halting problem (7,356 words) [view diff] no match in snippet view article find links to article
continue to run forever. The halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input
Decision problem (1,246 words) [view diff] no match in snippet view article find links to article
decision problem is a computational problem that can be posed as a yes–no question on a set of input values. An example of a decision problem is deciding
Species (10,502 words) [view diff] no match in snippet view article find links to article
Earth, regardless of the theoretical difficulties. If species were fixed and distinct from one another, there would be no problem, but evolutionary processes
Travelling salesman problem (11,633 words) [view diff] no match in snippet view article find links to article
In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances
Synoptic Gospels (4,235 words) [view diff] no match in snippet view article find links to article
relationship—the synoptic problem—has been a topic of debate for centuries and has been described as "the most fascinating literary enigma of all time". While no conclusive
Four color theorem (6,277 words) [view diff] no match in snippet view article find links to article
3-colorable. Hadwiger–Nelson problem: how many colors are needed to color the plane so that no two points at unit distance apart have the same color? From Gonthier
Problem of induction (4,423 words) [view diff] no match in snippet view article find links to article
from the observed to the unobserved are known as "inductive inferences". David Hume, who first formulated the problem in 1739, argued that there is no non-circular
Year 2038 problem (3,065 words) [view diff] no match in snippet view article find links to article
The year 2038 problem (also known as Y2038, Y2K38, Y2K38 superbug or the Epochalypse) is a time computing problem that leaves some computer systems unable
Morgan Wallen (6,394 words) [view diff] no match in snippet view article find links to article
non-consecutive weeks atop the chart throughout 2023, and topped the 2023 year-end chart. Wallen's fourth studio album I'm the Problem was released on May 16
Racketeering (856 words) [view diff] no match in snippet view article find links to article
solves a problem that would not exist without the racket. However, racketeers may also sometimes offer an ostensibly effectual service outside of the law to
Algorithm (6,907 words) [view diff] no match in snippet view article find links to article
produce the answer in a finite number of steps... a machine which will then solve any problem of the set with no human intervention beyond inserting the question
Problem gambling (7,213 words) [view diff] no match in snippet view article find links to article
Problem gambling, ludopathy, or ludomania is repetitive gambling behavior despite harm and negative consequences. Problem gambling may be diagnosed as
Discrete logarithm (2,506 words) [view diff] no match in snippet view article find links to article
However, no efficient method is known for computing them in general. In cryptography, the computational complexity of the discrete logarithm problem, along
NP (complexity) (2,784 words) [view diff] no match in snippet view article
class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is "yes", have proofs verifiable
Undecidable problem (1,921 words) [view diff] no match in snippet view article find links to article
problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting
Collatz conjecture (7,098 words) [view diff] no match in snippet view article find links to article
to 1? More unsolved problems in mathematics The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether
Boolean satisfiability problem (5,047 words) [view diff] no match in snippet view article find links to article
In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY
Wicked problem (3,687 words) [view diff] no match in snippet view article find links to article
recognize. It refers to an idea or problem that cannot be fixed, where there is no single solution to the problem; "wicked" does not indicate evil, but
Mind–body problem (7,754 words) [view diff] no match in snippet view article find links to article
The mind–body problem is a philosophical problem concerning the relationship between thought and consciousness in the human mind and body. It addresses
Problem solving (9,997 words) [view diff] no match in snippet view article find links to article
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
Chess problem (4,299 words) [view diff] no match in snippet view article find links to article
with chess problems. This article uses algebraic notation to describe chess moves. The term chess problem is not sharply defined: there is no clear demarcation
Continuum hypothesis (4,061 words) [view diff] no match in snippet view article find links to article
Hilbert's 23 problems presented in 1900. The answer to this problem is independent of ZFC, so that either the continuum hypothesis or its negation can
Graph coloring (8,459 words) [view diff] no match in snippet view article find links to article
share a boundary have the same color. Vertex coloring is often used to introduce graph coloring problems, since other coloring problems can be transformed
Philosophy of mind (12,161 words) [view diff] no match in snippet view article find links to article
philosophy that deals with the nature of the mind and its relation to the body and the external world. The mind–body problem is a paradigmatic issue in
Integer factorization (2,983 words) [view diff] no match in snippet view article find links to article
Unsolved problem in computer science Can integer factorization be solved in polynomial time on a classical computer? More unsolved problems in computer
Linear programming (6,690 words) [view diff] no match in snippet view article find links to article
problems, "stalling" occurs: many pivots are made with no increase in the objective function. In rare practical problems, the usual versions of the simplex
Demarcation problem (3,878 words) [view diff] no match in snippet view article find links to article
and epistemology, the demarcation problem is the question of how to distinguish between science and non-science. It also examines the boundaries between
Hard problem of consciousness (12,812 words) [view diff] no match in snippet view article find links to article
In the philosophy of mind, the hard problem of consciousness is to explain why and how humans and other organisms have qualia, phenomenal consciousness
Minimum spanning tree (5,460 words) [view diff] no match in snippet view article find links to article
such that no spanning tree outside the subset has smaller weight. (Note that this problem is unrelated to the k-minimum spanning tree.) The Euclidean
Problem of Hell (6,752 words) [view diff] no match in snippet view article find links to article
The problem of Hell is an ethical problem in the Abrahamic religions of Christianity and Islam, in which the existence of Hell or Jahannam for the punishment
Online gambling (12,417 words) [view diff] no match in snippet view article find links to article
to gambling, these chemicals are no longer released by other pleasurable things. Online gambling becomes a problem when it causes stress, anxiety and
Shortest path problem (4,764 words) [view diff] no match in snippet view article find links to article
graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its
List of philosophical problems (6,670 words) [view diff] no match in snippet view article find links to article
of some of the major problems in philosophy. A counterfactual statement is a conditional statement with a false antecedent. For example, the statement
Problem (Ariana Grande song) (10,169 words) [view diff] no match in snippet view article
"Problem" is a song by American singer Ariana Grande, featuring Australian rapper Iggy Azalea. It was released by Republic Records on April 28, 2014 as
Cosmic inflation (12,602 words) [view diff] no match in snippet view article find links to article
avoid the initial conditions problem by proposing models for an eternally inflating universe with no origin. These models propose that while the Universe
NP-hardness (1,119 words) [view diff] no match in snippet view article find links to article
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
Is–ought problem (3,850 words) [view diff] no match in snippet view article find links to article
The is–ought problem, as articulated by the Scottish philosopher and historian David Hume, arises when one makes claims about what ought to be that are
Mathematical optimization (6,175 words) [view diff] no match in snippet view article find links to article
found. They can include constrained problems and multimodal problems. An optimization problem can be represented in the following way: Given: a function
Eight queens puzzle (3,791 words) [view diff] no match in snippet view article find links to article
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires
Seven Bridges of Königsberg (1,789 words) [view diff] no match in snippet view article find links to article
are explicitly unacceptable. Euler proved that the problem has no solution. The difficulty he faced was the development of a suitable technique of analysis
Millennium Prize Problems (2,626 words) [view diff] no match in snippet view article find links to article
prize for the first correct solution to each problem. The Clay Mathematics Institute officially designated the title Millennium Problem for the seven unsolved
Anton Bruckner (7,441 words) [view diff] no match in snippet view article find links to article
Symphony No. 8/2, C minor, 1890 version. Edited by Leopold Nowak. New York: Eulenburg, 1994. Cooke, Deryck (1969), "The Bruckner Problem Simplified", The Musical
Independent set (graph theory) (3,561 words) [view diff] no match in snippet view article
problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As such, it is unlikely that there exists
Invariant subspace problem (2,297 words) [view diff] no match in snippet view article find links to article
In the field of mathematics known as functional analysis, the invariant subspace problem is a partially unresolved problem asking whether every bounded
No Problem (Chance the Rapper song) (642 words) [view diff] no match in snippet view article
"No Problem" is a song by American rapper Chance the Rapper featuring fellow American rappers Lil Wayne and 2 Chainz. The track, produced by Chance himself
Graph theory (6,237 words) [view diff] no match in snippet view article find links to article
problem Minimum spanning tree Route inspection problem (also called the "Chinese postman problem") Seven bridges of Königsberg Shortest path problem Steiner
The Problem Solverz (2,957 words) [view diff] no match in snippet view article find links to article
The Problem Solverz is an American animated television series created by Ben Jones for Cartoon Network. It follows Alfe, Roba, and Horace; a group of
Knapsack problem (7,799 words) [view diff] no match in snippet view article find links to article
The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items
Eight queens puzzle (3,791 words) [view diff] no match in snippet view article find links to article
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires
Boundary value problem (1,037 words) [view diff] no match in snippet view article find links to article
In the study of differential equations, a boundary-value problem is a differential equation subjected to constraints called boundary conditions. A solution
Free will (25,556 words) [view diff] no match in snippet view article find links to article
concerns, sharing only the common feature of not finding the possibility of determinism a threat to the possibility of free will. The problem of free will has
Problem of other minds (1,132 words) [view diff] no match in snippet view article find links to article
The problem of other minds is a philosophical problem traditionally stated as the following epistemological question: "Given that I can only observe the
List of unsolved problems in mathematics (20,026 words) [view diff] no match in snippet view article find links to article
the solution to a long-standing problem, and some lists of unsolved problems, such as the Millennium Prize Problems, receive considerable attention.
David Hilbert (7,097 words) [view diff] no match in snippet view article find links to article
either. ... The true reason why [no-one] has succeeded in finding an unsolvable problem is, in my opinion, that there is no unsolvable problem. In contrast
Poincaré conjecture (5,324 words) [view diff] no match in snippet view article find links to article
Hamilton's program of using the Ricci flow to solve the problem. By developing a number of new techniques and results in the theory of Ricci flow, Grigori
Cyprus problem (17,657 words) [view diff] no match in snippet view article find links to article
The Cyprus problem, also known as the Cyprus conflict, Cyprus issue, Cyprus dispute, or Cyprus question, is an ongoing dispute between the Greek Cypriot
Calculus of variations (9,524 words) [view diff] no match in snippet view article find links to article
functionals may be found using the Euler–Lagrange equation of the calculus of variations. A simple example of such a problem is to find the curve of shortest length
Catch-22 (logic) (2,296 words) [view diff] no match in snippet view article
Self-reference Social trap Strange loop Vicious circle Wicked problem Zugzwang Largest Idioms Dictionary, The Idioms. "Catch 22 meaning". Theidioms.com. Retrieved
Geodesy (4,261 words) [view diff] no match in snippet view article find links to article
are two main problems: First geodetic problem (also known as direct or forward geodetic problem): given the coordinates of a point and the directional
Measurement problem (2,441 words) [view diff] no match in snippet view article find links to article
In quantum mechanics, the measurement problem is the problem of definite outcomes: quantum systems have superpositions but quantum measurements only give
Time complexity (5,003 words) [view diff] no match in snippet view article find links to article
solutions but no known polynomial time solution include the planted clique problem in which the goal is to find a large clique in the union of a clique
Campaign for the neologism "santorum" (3,359 words) [view diff] no match in snippet view article find links to article
unhealthy culture. Santorum said that, while he had no problem with homosexuality, he did have a problem with homosexual acts, "as I would with acts of other
Time formatting and storage bugs (7,013 words) [view diff] no match in snippet view article find links to article
arithmetic overflow, but can also be the result of other issues. The best-known consequence of this type is the Y2K problem, but many other milestone dates
Convex optimization (3,166 words) [view diff] no match in snippet view article find links to article
optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing
Hilbert's problems (3,677 words) [view diff] no match in snippet view article find links to article
Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. They were all unsolved at the time, and several
Tangent (4,113 words) [view diff] no match in snippet view article find links to article
explicitly. The question of finding the tangent line to a graph, or the tangent line problem, was one of the central questions leading to the development
Confirmation holism (1,074 words) [view diff] no match in snippet view article find links to article
extending Pierre Duhem's problem of underdetermination in physical theory to all knowledge claims. Duhem's idea was, roughly, that no theory of any type can
Panpsychism (9,735 words) [view diff] no match in snippet view article find links to article
interest in panpsychism in the 21st century because it addresses the hard problem directly. The term panpsychism comes from the Greek pan (πᾶν: "all, everything
Ant colony optimization algorithms (9,484 words) [view diff] no match in snippet view article find links to article
operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems that can be reduced to
Theodicy (9,777 words) [view diff] no match in snippet view article find links to article
"god" and δίκη dikē, "justice") is an argument that attempts to resolve the problem of evil that arises when all power and all goodness are simultaneously
Windows Error Reporting (1,599 words) [view diff] no match in snippet view article find links to article
have resulted in silent program termination with no error report. A new Control Panel applet, "Problem Reports and Solutions" was also introduced, keeping
El Farol Bar problem (1,425 words) [view diff] no match in snippet view article find links to article
The El Farol bar problem is a problem in game theory. Every Thursday night, a fixed population want to go have fun at the El Farol Bar, unless it's too
The International Jew (1,767 words) [view diff] no match in snippet view article find links to article
beginning with The International Jew: The World's Problem, published on May 22, 1920. At the beginning of 1920, Ford's personal newspaper, The Dearborn Independent
Free-rider problem (4,823 words) [view diff] no match in snippet view article find links to article
In economics, the free-rider problem is a type of market failure that occurs when those who benefit from resources, public goods and common pool resources
Elitzur–Vaidman bomb tester (3,762 words) [view diff] no match in snippet view article find links to article
(2023-09-24). "Exploring Quantum Comprehension Through the Elitzur-Vaidman Bomb Testing Problem". Brazilian Journal of Physics. 53 (6): 152. doi:10
Structuralism (philosophy of science) (2,539 words) [view diff] no match in snippet view article
make the success of science seem miraculous, i.e., it puts forward a no-miracles argument. The so-called Newman problem (also Newman's problem, Newman
Circular reasoning (586 words) [view diff] no match in snippet view article find links to article
The problem of circular reasoning has been noted in Western philosophy at least as far back as the Pyrrhonist philosopher Agrippa who includes the problem
Root cause analysis (3,904 words) [view diff] no match in snippet view article find links to article
root cause analysis (RCA) is a method of problem solving used for identifying the root causes of faults or problems. It is widely used in IT operations, manufacturing
Diophantine equation (4,809 words) [view diff] no match in snippet view article find links to article
number is the dth power of another rational number). A witness of the difficulty of the problem is Fermat's Last Theorem (for d > 2, there is no integer
Conjecture (3,042 words) [view diff] no match in snippet view article find links to article
status of the P versus NP problem, Communications of the ACM 52 (2009), no. 9, pp. 78–86. doi:10.1145/1562164.1562186 Richards, Ian (1974). "On the Incompatibility
Embarrassingly parallel (992 words) [view diff] no match in snippet view article find links to article
needed to split the problem into a number of parallel tasks. This is due to minimal or no dependency upon communication between the parallel tasks, or
Puzzle (1,187 words) [view diff] no match in snippet view article find links to article
A puzzle is a game, problem, or toy that tests a person's ingenuity or knowledge. In a puzzle, the solver is expected to put pieces together (or take them
Expressivism (1,517 words) [view diff] no match in snippet view article find links to article
or factual judgment.[citation needed] The Frege–Geach problem – named for Peter Geach, who developed it from the writings of Gottlob Frege – claims that
Quantum algorithm (4,560 words) [view diff] no match in snippet view article find links to article
is no speedup, since a classical probabilistic algorithm can solve the problem with a constant number of queries with small probability of error. The algorithm
Multiple comparisons problem (2,558 words) [view diff] no match in snippet view article find links to article
In statistics, the multiple comparisons, multiplicity or multiple testing problem occurs when one considers a set of statistical inferences simultaneously
Gettier problem (6,193 words) [view diff] no match in snippet view article find links to article
The Gettier problem, in the field of epistemology, is a landmark philosophical problem concerning the understanding of descriptive knowledge. Attributed
Ad hoc (595 words) [view diff] no match in snippet view article find links to article
to deal with a particular problem, the tendency of which has given rise to the noun adhocism. This concept highlights the flexibility and adaptability
Finite element method (7,792 words) [view diff] no match in snippet view article find links to article
arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer
Packing problems (2,676 words) [view diff] no match in snippet view article find links to article
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either
Ad hoc (595 words) [view diff] no match in snippet view article find links to article
to deal with a particular problem, the tendency of which has given rise to the noun adhocism. This concept highlights the flexibility and adaptability
Deutsch–Jozsa algorithm (2,191 words) [view diff] no match in snippet view article find links to article
deterministic classical algorithm. It is a black box problem that can be solved efficiently by a quantum computer with no error, whereas a deterministic classical
Finite element method (7,792 words) [view diff] no match in snippet view article find links to article
arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer
Karma (12,608 words) [view diff] no match in snippet view article find links to article
rebirth, and the problem of evil, Philosophy East & West, Vol. 55, No. 1, pp. 15–32 Chadha and Trakakis (2007), Karma and the Problem of Evil: A Response
Packing problems (2,676 words) [view diff] no match in snippet view article find links to article
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either
Trolley problem (4,232 words) [view diff] no match in snippet view article find links to article
The trolley problem is a series of thought experiments in ethics, psychology, and artificial intelligence involving stylized ethical dilemmas of whether
Scunthorpe problem (3,461 words) [view diff] no match in snippet view article find links to article
The Scunthorpe problem is the unintentional blocking of online content by a spam filter or search engine because their text contains a string (or substring)
Dining philosophers problem (2,733 words) [view diff] no match in snippet view article find links to article
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues
Spatial analysis (9,955 words) [view diff] no match in snippet view article find links to article
resolved, but form the basis for current research. The most fundamental of these is the problem of defining the spatial location of the entities being studied
Daylight saving time (12,832 words) [view diff] no match in snippet view article find links to article
time being the permanent method of keeping time. Advocates cite the same advantages as normal DST without the problems associated with the twice-yearly
Artificial intelligence (28,679 words) [view diff] no match in snippet view article find links to article
(AI) is the capability of computational systems to perform tasks typically associated with human intelligence, such as learning, reasoning, problem-solving
Thought (13,707 words) [view diff] no match in snippet view article find links to article
Their most paradigmatic forms are judging, reasoning, concept formation, problem solving, and deliberation. But other mental processes, like considering
Product design (1,955 words) [view diff] no match in snippet view article find links to article
is where the key issue of the matter is defined. The conditions of the problem become objectives, and restraints on the situation become the parameters
Chicken or the egg (1,175 words) [view diff] no match in snippet view article find links to article
addressing the problem of origins and first cause. Aristotle, writing in the fourth century BCE, concluded that this was an infinite sequence, with no true
Principal–agent problem (9,357 words) [view diff] no match in snippet view article find links to article
The principal–agent problem refers to the conflict in interests and priorities that arises when one person or entity (the "agent") takes actions on behalf
Einstein problem (1,155 words) [view diff] no match in snippet view article find links to article
extension of the second part of Hilbert's eighteenth problem, which asks for a single polyhedron that tiles Euclidean 3-space, but such that no tessellation
Motion planning (3,119 words) [view diff] no match in snippet view article find links to article
known as the navigation problem or the piano mover's problem) is a computational problem to find a sequence of valid configurations that moves the object
Least squares (5,601 words) [view diff] no match in snippet view article find links to article
minimized. The most important application is in data fitting. When the problem has substantial uncertainties in the independent variable (the x variable)
Big Bang (15,946 words) [view diff] no match in snippet view article find links to article
radiation, and large-scale structure. The uniformity of the universe, known as the horizon and flatness problems, is explained through cosmic inflation:
Economic calculation problem (6,278 words) [view diff] no match in snippet view article find links to article
The economic calculation problem (ECP) is a criticism of using central economic planning as a substitute for market-based allocation of the factors of
Terence Tao (6,678 words) [view diff] no match in snippet view article find links to article
J. Amer. Math. Soc. 20 (2007), no. 3, 753–798. Lemarié-Rieusset, Pierre Gilles (2016). The Navier–Stokes problem in the 21st century. Boca Raton, FL: CRC
Falsifiability (19,517 words) [view diff] no match in snippet view article find links to article
logically falsify the claim. Popper proposed falsifiability as the cornerstone solution to both the problem of induction and the problem of demarcation.
Problem of Apollonius (12,269 words) [view diff] no match in snippet view article find links to article
In Euclidean plane geometry, Apollonius's problem is to construct circles that are tangent to three given circles in a plane (Figure 1). Apollonius of
Entscheidungsproblem (2,642 words) [view diff] no match in snippet view article find links to article
In mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed
Prisoner's dilemma (9,524 words) [view diff] no match in snippet view article find links to article
needed] The 2008 film The Dark Knight includes a scene loosely based on the problem in which the Joker rigs two ferries, one containing prisoners and the other
Design thinking (4,520 words) [view diff] no match in snippet view article find links to article
: 39  In the 2010s, the category of super wicked global problems emerged as well. Wicked problems have features such as no definitive formulation, no true/false
The Problem with Apu (2,933 words) [view diff] no match in snippet view article find links to article
The Problem with Apu is a 2017 American documentary film written by and starring comedian Hari Kondabolu and produced and directed by Michael Melamedoff
Doubling the cube (2,081 words) [view diff] no match in snippet view article find links to article
Doubling the cube, also known as the Delian problem, is an ancient: 9  geometric problem. Given the edge of a cube, the problem requires the construction
Heesch's problem (899 words) [view diff] no match in snippet view article find links to article
can surround it with no overlaps and no gaps. Heesch's problem is the problem of determining the set of numbers that can be Heesch numbers. Both are named
Philosophy of computer science (909 words) [view diff] no match in snippet view article find links to article
computer scientists believe that P ≠ NP. Apart from the reason that after decades of studying these problems no one has been able to find a polynomial-time algorithm
Elliptic-curve cryptography (4,677 words) [view diff] no match in snippet view article find links to article
of the elliptic curve, measured by the total number of discrete integer pairs satisfying the curve equation, determines the difficulty of the problem. The
RSA cryptosystem (7,783 words) [view diff] no match in snippet view article find links to article
known as the RSA problem. Whether it is as difficult as the factoring problem is an open question. There are no published methods to defeat the system if
Jewish question (3,015 words) [view diff] no match in snippet view article find links to article
whether the problem of the Jewish question had more to do with the problems posed by the German Jews' opponents or vice versa: the problem posed by the existence
N-body problem (8,738 words) [view diff] no match in snippet view article find links to article
In physics, the n-body problem is the problem of predicting the individual motions of a group of celestial objects interacting with each other gravitationally
Two envelopes problem (8,302 words) [view diff] no match in snippet view article find links to article
The two envelopes problem, also known as the exchange paradox, is a paradox in probability theory. It is of special interest in decision theory and for
Dynamic programming (9,283 words) [view diff] no match in snippet view article find links to article
between the value of the larger problem and the values of the sub-problems. In the optimization literature this relationship is called the Bellman equation
Comenius University (1,058 words) [view diff] no match in snippet view article find links to article
to ponder Znám's problem in modern mathematics Miroslav Lajcak – diplomat, President of the United Nations General Assembly for the 72nd session Zuzana
Hierarchy problem (3,470 words) [view diff] no match in snippet view article find links to article
theoretical physics, the hierarchy problem is the problem concerning the large discrepancy between aspects of the weak force and gravity. There is no scientific
Hilbert's tenth problem (3,277 words) [view diff] no match in snippet view article find links to article
By contrast, the Diophantine equation x 2 + y 2 + 1 = 0 {\displaystyle x^{2}+y^{2}+1=0} has no such solution. Hilbert's tenth problem has been solved
Knight's tour (2,318 words) [view diff] no match in snippet view article find links to article
instance of the Hamiltonian cycle problem. Unlike the general Hamiltonian path problem, the knight's tour problem can be solved in linear time. The earliest
Tessellation (6,055 words) [view diff] no match in snippet view article find links to article
tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics
Knot theory (6,298 words) [view diff] no match in snippet view article find links to article
fundamental problem in knot theory is determining when two descriptions represent the same knot. A complete algorithmic solution to this problem exists, which
Wason selection task (1,988 words) [view diff] no match in snippet view article find links to article
The Wason selection task (or four-card problem) is a logic puzzle devised by Peter Cathcart Wason in 1966. It is one of the most famous tasks in the study
Evolutionary algorithm (4,553 words) [view diff] no match in snippet view article find links to article
elements of the biological evolution in a computer algorithm in order to solve "difficult" problems, at least approximately, for which no exact or satisfactory
Dark matter (15,043 words) [view diff] no match in snippet view article find links to article
Unsolved problem in physics What is dark matter? How was it generated? More unsolved problems in physics In astronomy, dark matter is an invisible and
Quantum computing (12,431 words) [view diff] no match in snippet view article find links to article
solving the hidden subgroup problem for abelian finite groups. These algorithms depend on the primitive of the quantum Fourier transform. No mathematical
Creation science (11,153 words) [view diff] no match in snippet view article find links to article
cosmologies is that the accepted distances in the Universe require millions or billions of years for light to travel to Earth (the "starlight problem"). An older
Riemann hypothesis (16,742 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics Do all non-trivial zeroes of the Riemann zeta function have a real part of one half? More unsolved problems in mathematics
Classification (502 words) [view diff] no match in snippet view article find links to article
depends greatly on the characteristics of the data to be classified. There is no single classifier that works best on all given problems (a phenomenon that
Flow network (3,081 words) [view diff] no match in snippet view article find links to article
solve problems that can be reduced to a flow network, including survey design, airline scheduling, image segmentation, and the matching problem. A network
Publication bias (3,854 words) [view diff] no match in snippet view article find links to article
"filed away" and go no further than the researchers' file drawers, leading to a bias in published research. The term "file drawer problem" was coined by psychologist
Endianness (4,906 words) [view diff] no match in snippet view article find links to article
network order; the ntohs and ntohl functions convert from network to host order. These functions may be a no-op on a big-endian system. While the high-level
Faint blue galaxy (645 words) [view diff] no match in snippet view article find links to article
were first noticed in the 1970s, posing a problem for then-current theories of galaxy formation. FBGs tend to be found in the peripheries of galaxy clusters
Predation problem (4,019 words) [view diff] no match in snippet view article find links to article
The predation problem or predation argument refers to the consideration of the harms experienced by animals due to predation as a moral problem, that
Social issue (5,654 words) [view diff] no match in snippet view article find links to article
A social issue is a problem that affects many people within a society. It is a group of common problems in present-day society that many people strive
Squaring the circle (4,922 words) [view diff] no match in snippet view article find links to article
Squaring the circle is a problem in geometry first proposed in Greek mathematics. It is the challenge of constructing a square with the area of a given
Stokes problem (1,984 words) [view diff] no match in snippet view article find links to article
{\displaystyle \nu } is the kinematic viscosity. The pressure gradient does not enter into the problem. The initial, no-slip condition on the wall is u ( 0 ,
Gray goo (1,965 words) [view diff] no match in snippet view article find links to article
there is no need to build anything that even resembles a potential runaway replicator. This would avoid the problem entirely. In a paper in the journal
Goldbach's conjecture (3,720 words) [view diff] no match in snippet view article find links to article
the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum
Complexity class (10,382 words) [view diff] no match in snippet view article find links to article
the answer to the decision problem is "yes" and "rejects" if the answer is "no". While some problems cannot easily be expressed as decision problems,
Fair cake-cutting (4,016 words) [view diff] no match in snippet view article find links to article
Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with different toppings, that is assumed
Philosophical zombie (4,641 words) [view diff] no match in snippet view article find links to article
is important in the context of the mind-evolution problem. A zombie universe is identical to our world in all physical ways, except no being in it has
Trial and error (1,928 words) [view diff] no match in snippet view article find links to article
fundamental method of problem-solving characterized by repeated, varied attempts which are continued until success, or until the practicer stops trying
Fleet problem (5,300 words) [view diff] no match in snippet view article find links to article
Pacific Fleet around 2016. The first twenty-one Fleet Problems — labeled by Navy leadership as Fleet Problem I through Fleet Problem XXI — were conducted between
Squaring the square (1,680 words) [view diff] no match in snippet view article find links to article
Squaring the square is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integer
3 Body Problem (TV series) (3,733 words) [view diff] no match in snippet view article
3 Body Problem is an American science fiction television series created by David Benioff, D. B. Weiss and Alexander Woo. The third streaming adaptation
Matching (graph theory) (2,938 words) [view diff] no match in snippet view article
network flow problem. Given a graph G = (V, E), a matching M in G is a set of pairwise non-adjacent edges, none of which are loops; that is, no two edges
Faster-than-light (7,979 words) [view diff] no match in snippet view article find links to article
special relativity or creates problems with causality, and thus neither qualifies as faster-than-light as described here. In the following examples, certain
Combinatorial optimization (1,847 words) [view diff] no match in snippet view article find links to article
travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously
The Problem with Jon Stewart (1,004 words) [view diff] no match in snippet view article find links to article
The Problem with Jon Stewart is an American current affairs television series hosted by Jon Stewart on Apple TV+. Each episode focuses on a single issue
Heuristic (8,766 words) [view diff] no match in snippet view article find links to article
A heuristic or heuristic technique (problem solving, mental shortcut, rule of thumb) is any approach to problem solving that employs a pragmatic method
Proof of impossibility (3,915 words) [view diff] no match in snippet view article find links to article
an impossibility theorem is a theorem that demonstrates a problem or general set of problems cannot be solved. These are also known as proofs of impossibility
Sorting algorithm (6,557 words) [view diff] no match in snippet view article find links to article
From the beginning of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently despite
Dirty Deeds Done Dirt Cheap (3,643 words) [view diff] no match in snippet view article find links to article
would often introduce "Problem Child" as being about Angus. "Ain't No Fun (Waiting 'Round to be a Millionaire)" is one of the few AC/DC songs that has
Joke chess problem (1,258 words) [view diff] no match in snippet view article find links to article
A joke chess problem is a puzzle in chess that uses humor as an element. Although most chess problems, like other creative forms, are appreciated for serious
The Three-Body Problem (novel) (3,890 words) [view diff] no match in snippet view article
The Three-Body Problem (Chinese: 三体; lit. 'three body') is a 2008 novel by the Chinese hard science fiction author Liu Cixin. It is the first novel in
Coastline paradox (2,940 words) [view diff] no match in snippet view article find links to article
size. The problem is fundamentally different from the measurement of other, simpler edges. It is possible, for example, to accurately measure the length
Brute-force search (2,069 words) [view diff] no match in snippet view article find links to article
is typically used when the problem size is limited, or when there are problem-specific heuristics that can be used to reduce the set of candidate solutions
Optimization problem (885 words) [view diff] no match in snippet view article find links to article
economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two
Untitled Korn album (1,783 words) [view diff] no match in snippet view article find links to article
Slipknot would tour with Korn on the Family Values Tour, along with the Bitch We Have a Problem Tour. When premiering the single "Evolution" on KROQ on May
Genetic algorithm (8,221 words) [view diff] no match in snippet view article find links to article
objective function in the optimization problem being solved. The more fit individuals are stochastically selected from the current population, and each individual's
Byzantine fault (4,058 words) [view diff] no match in snippet view article find links to article
whether a system component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in
Branch and bound (2,432 words) [view diff] no match in snippet view article find links to article
optimization problems by breaking them down into smaller sub-problems and using a bounding function to eliminate sub-problems that cannot contain the optimal
Vibration (7,227 words) [view diff] no match in snippet view article find links to article
over the range of motion of interest. Hence, the solution to the problem with a square wave is summing the predicted vibration from each one of the harmonic
Nearest neighbor search (3,341 words) [view diff] no match in snippet view article find links to article
neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar)
Marilyn vos Savant (3,124 words) [view diff] no match in snippet view article find links to article
and answers questions on various subjects, and which popularized the Monty Hall problem in 1990. Marilyn vos Savant was born Marilyn Mach on August 11,
Hilbert's sixteenth problem (1,243 words) [view diff] no match in snippet view article find links to article
list of 23 problems in mathematics. The original problem was posed as the Problem of the topology of algebraic curves and surfaces (Problem der Topologie
Gödel's incompleteness theorems (12,173 words) [view diff] no match in snippet view article find links to article
is no algorithm to solve the halting problem. The incompleteness theorems apply to formal systems that are of sufficient complexity to express the basic
Software design pattern (3,180 words) [view diff] no match in snippet view article find links to article
design pattern is a general, reusable solution to a commonly occurring problem in many contexts in software design. A design pattern is not a rigid structure
Intentionality (5,117 words) [view diff] no match in snippet view article find links to article
intentionality has been the problem of intentional inexistence: to determine the ontological status of the entities which are the objects of intentional
Epiphenomenalism (2,831 words) [view diff] no match in snippet view article find links to article
Epiphenomenalism is a position in the philosophy of mind on the mind–body problem. It holds that subjective mental events are completely dependent for
Clique problem (9,905 words) [view diff] no match in snippet view article find links to article
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called
Benny Morris (6,346 words) [view diff] no match in snippet view article find links to article
book The Birth of the Palestinian Refugee Problem, 1947–1948 which, based on then recently declassified Israeli archives, demonstrated that the 1948 exodus
Post-quantum cryptography (6,408 words) [view diff] no match in snippet view article find links to article
algorithms rely on the difficulty of one of three mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve
Co-NP (964 words) [view diff] no match in snippet view article find links to article
yes-instance for the original NP problem becomes a no-instance for its complement, and vice versa. An example of an NP-complete problem is the Boolean satisfiability
Binding problem (6,825 words) [view diff] no match in snippet view article find links to article
perception. It is considered a "problem" because no complete model exists. The binding problem can be subdivided into the four areas of perception, neuroscience
Fermat's Last Theorem (11,739 words) [view diff] no match in snippet view article find links to article
formulation of the problem. Equivalent statement 2: xn + yn = zn, where integer n ≥ 3, has no non-trivial solutions x, y, z ∈ Q. This is because the exponents
Existence of God (22,114 words) [view diff] no match in snippet view article find links to article
Belief." The Journal of Philosophy, vol. 67, no. 14, 1970, pp. 471–476. Draper, Paul. "The Problem of the Hiddenness of God and the Problem of Evil."
Economic lot scheduling problem (1,876 words) [view diff] no match in snippet view article find links to article
The economic lot scheduling problem (ELSP) is a problem in operations management and inventory theory that has been studied by many researchers for more
Philosophical skepticism (9,776 words) [view diff] no match in snippet view article find links to article
) Among other arguments, skeptics use the Münchhausen trilemma and the problem of the criterion to claim that no certain belief can be achieved. This position
Economic lot scheduling problem (1,876 words) [view diff] no match in snippet view article find links to article
The economic lot scheduling problem (ELSP) is a problem in operations management and inventory theory that has been studied by many researchers for more
Open problem (408 words) [view diff] no match in snippet view article find links to article
not yet been solved (i.e., no solution for it is known). In the history of science, some of these supposed open problems were "solved" by means of showing
Binding problem (6,825 words) [view diff] no match in snippet view article find links to article
perception. It is considered a "problem" because no complete model exists. The binding problem can be subdivided into the four areas of perception, neuroscience
RSA problem (681 words) [view diff] no match in snippet view article find links to article
In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a
Infinite regress (3,336 words) [view diff] no match in snippet view article find links to article
infinite regress is responsible for the theory in question being implausible or for its failure to solve the problem it was formulated to solve. Traditionally
Fermat's Last Theorem (11,739 words) [view diff] no match in snippet view article find links to article
formulation of the problem. Equivalent statement 2: xn + yn = zn, where integer n ≥ 3, has no non-trivial solutions x, y, z ∈ Q. This is because the exponents
Poisson's equation (2,371 words) [view diff] no match in snippet view article find links to article
universal gravitation. Many problems in electrostatics are governed by the Poisson equation, which relates the electric potential φ to the free charge density
Reliabilism (1,187 words) [view diff] no match in snippet view article find links to article
given. Another objection to reliabilism is called the new evil demon problem. The evil demon problem originally motivated skepticism, but can be repurposed
Shor's algorithm (5,812 words) [view diff] no match in snippet view article find links to article
for solving the factoring problem, the discrete logarithm problem, and the period-finding problem. "Shor's algorithm" usually refers to the factoring algorithm
Genetic disorder (3,613 words) [view diff] no match in snippet view article find links to article
A genetic disorder is a health problem caused by one or more abnormalities in the genome. It can be caused by a mutation in a single gene (monogenic) or
Brainstorming (4,675 words) [view diff] no match in snippet view article find links to article
the term "brainstorm sessions", taking the concept after the use of "the brain to storm a problem". During the period when Osborn made his concept, he
Associative array (2,802 words) [view diff] no match in snippet view article find links to article
operations. The dictionary problem is the classic problem of designing efficient data structures that implement associative arrays. The two major solutions
Co-NP (964 words) [view diff] no match in snippet view article find links to article
yes-instance for the original NP problem becomes a no-instance for its complement, and vice versa. An example of an NP-complete problem is the Boolean satisfiability
Troubleshooting (2,477 words) [view diff] no match in snippet view article find links to article
form of problem solving, often applied to repair failed products or processes on a machine or a system. It is a logical, systematic search for the source
Nature versus nurture (7,942 words) [view diff] no match in snippet view article find links to article
was obviously negative to the question, the phrase has often been cited as an early quest into the nature versus nurture problem. John Locke's An Essay Concerning
Fair division (2,964 words) [view diff] no match in snippet view article find links to article
Fair division is the problem in game theory of dividing a set of resources among several people who have an entitlement to them so that each person receives
Two-body problem in general relativity (6,744 words) [view diff] no match in snippet view article find links to article
The two-body problem in general relativity (or relativistic two-body problem) is the determination of the motion and gravitational field of two bodies
Suslin's problem (781 words) [view diff] no match in snippet view article find links to article
continuum? The original statement of Suslin's problem from (Suslin 1920) Suslin's problem asks: Given a non-empty totally ordered set R with the four properties
All's Well That Ends Well (2,211 words) [view diff] no match in snippet view article find links to article
with possible dates ranging from 1598 to 1608. The play is considered one of Shakespeare's "problem plays", a play that poses complex ethical dilemmas
BQP (3,518 words) [view diff] no match in snippet view article find links to article
of at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantum
Blue screen of death (5,037 words) [view diff] no match in snippet view article find links to article
is no memory dump saved. Since the system is unable to boot from the hard drive in this situation, correction of the problem often requires using the repair
Star Wars: Skeleton Crew (4,584 words) [view diff] no match in snippet view article find links to article
buried under one problem: this is a premise that doesn't know how to be a TV show yet." The show received three nominations at the 23rd Visual Effects
Three utilities problem (2,758 words) [view diff] no match in snippet view article find links to article
The three utilities problem, also known as water, gas and electricity, is a mathematical puzzle that asks for non-crossing connections to be drawn between
Pigouvian tax (7,391 words) [view diff] no match in snippet view article find links to article
with other markets, such as the labor market. In his 2011 paper, "The Problem of Social Cost: What Problem? A Critique of the Reasoning of A.C. Pigou and
K-nearest neighbors algorithm (4,333 words) [view diff] no match in snippet view article find links to article
overcome this problem is to weight the classification, taking into account the distance from the test point to each of its k nearest neighbors. The class (or
Computational problem (984 words) [view diff] no match in snippet view article find links to article
computer science, a computational problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring "Given a positive
Socratic problem (2,812 words) [view diff] no match in snippet view article find links to article
In historical scholarship, the Socratic problem (also called Socratic question) concerns attempts at reconstructing a historical and philosophical image
Curve fitting (2,144 words) [view diff] no match in snippet view article find links to article
2D data points. The method elegantly transforms the ordinarily non-linear problem into a linear problem that can be solved without using iterative numerical
Mutual exclusion (2,336 words) [view diff] no match in snippet view article find links to article
seminal 1965 paper "Solution of a problem in concurrent programming control", which is credited as the first topic in the study of concurrent algorithms
Key exchange (1,397 words) [view diff] no match in snippet view article find links to article
property, both will need the other's public key. Key exchange is done either in-band or out-of-band. The key exchange problem describes ways to exchange
Inverse problem (9,072 words) [view diff] no match in snippet view article find links to article
An inverse problem in science is the process of calculating from a set of observations the causal factors that produced them: for example, calculating
Celestial mechanics (2,548 words) [view diff] no match in snippet view article find links to article
Poincaré showed that the three-body problem is not integrable. In other words, the general solution of the three-body problem can not be expressed in
Tragedy of the commons (15,306 words) [view diff] no match in snippet view article find links to article
Andersson, K. (1996). "The Tragedy of the Common Forest: Why the Pacific Northwest Forest Conflict is a 'No Technical Solution' Problem". Oregon Daily Emerald
Kidney failure (3,242 words) [view diff] no match in snippet view article find links to article
(ESRD), is a medical condition in which the kidneys can no longer adequately filter waste products from the blood, functioning at less than 15% of normal
Opinion poll (9,522 words) [view diff] no match in snippet view article find links to article
the original on 2013-01-31. Retrieved 2008-11-04. Silver, Nate (2008-07-22). "The Cellphone Problem, Revisited". FiveThirtyEight. Archived from the original
Vertex cover (2,556 words) [view diff] no match in snippet view article find links to article
of every edge of the graph. In computer science, the problem of finding a minimum vertex cover is a classical optimization problem. It is NP-hard, so
List of unsolved problems in computer science (1,167 words) [view diff] no match in snippet view article find links to article
unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known or when experts in the field disagree
Perturbation theory (2,959 words) [view diff] no match in snippet view article find links to article
a problem, by starting from the exact solution of a related, simpler problem. A critical feature of the technique is a middle step that breaks the problem
List of unsolved problems in physics (11,318 words) [view diff] no match in snippet view article find links to article
The following is a list of notable unsolved problems grouped into broad areas of physics. Some of the major unsolved problems in physics are theoretical
Consensus (computer science) (4,770 words) [view diff] no match in snippet view article
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes
Optimal control (4,734 words) [view diff] no match in snippet view article find links to article
deals with the problem of finding a control law for a given system such that a certain optimality criterion is achieved. A control problem includes a
Mind (17,702 words) [view diff] no match in snippet view article find links to article
dispositions to engage in observable behavior. The mind–body problem is the challenge of explaining the relation between matter and mind. Traditionally
Nominalism (4,422 words) [view diff] no match in snippet view article find links to article
pillars, snakes, and bananas). Nominalism is primarily a position on the problem of universals. It is opposed to realist philosophies, such as Platonic
Professor Moriarty (3,448 words) [view diff] no match in snippet view article find links to article
appears in the short story "The Adventure of the Final Problem", first published in The Strand Magazine in December 1893. He also plays a role in the final
The Feminine Mystique (4,005 words) [view diff] no match in snippet view article find links to article
their feelings. The Feminine Mystique begins with an introduction describing what Friedan called "the problem that has no name"—the widespread unhappiness
Underdetermination (1,732 words) [view diff] no match in snippet view article find links to article
rivals. A more general response from the scientific realist is to argue that underdetermination is no special problem for science, because, as indicated
Collingridge dilemma (760 words) [view diff] no match in snippet view article find links to article
double-bind problem: An information problem: impacts cannot be easily predicted until the technology is extensively developed and widely used. A power problem: control
Subject-matter expert (1,444 words) [view diff] no match in snippet view article find links to article
software organizations to produce and deliver more content but with little to no formal revision control for content releases (i.e. a living document). In
Problem Solvers Caucus (3,395 words) [view diff] no match in snippet view article find links to article
organization No Labels as early as 2014. It is co-chaired by Tom Suozzi (D-NY) and Brian Fitzpatrick (R-PA) as of 2025[update]. The Problem Solvers Caucus
Sturm–Liouville theory (4,722 words) [view diff] no match in snippet view article find links to article
and its applications, a Sturm–Liouville problem is a second-order linear ordinary differential equation of the form d d x [ p ( x ) d y d x ] + q ( x )
Trapdoor function (1,316 words) [view diff] no match in snippet view article find links to article
computers can guess all of the possible answers within a second – but this sample problem could be improved by using the product of two much larger primes
Feasible region (1,110 words) [view diff] no match in snippet view article find links to article
solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints
Simon's problem (3,247 words) [view diff] no match in snippet view article find links to article
computational complexity theory and quantum computing, Simon's problem is a computational problem that is proven to be solved exponentially faster on a quantum
The Feminine Mystique (4,005 words) [view diff] no match in snippet view article find links to article
their feelings. The Feminine Mystique begins with an introduction describing what Friedan called "the problem that has no name"—the widespread unhappiness
Cold dark matter (2,575 words) [view diff] no match in snippet view article find links to article
revealing a highly significant problem that is unlikely to be solved by improving the resolution of the simulations. The high bulgeless fraction was nearly
Backtracking (1,986 words) [view diff] no match in snippet view article find links to article
solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate
Lateral thinking (1,688 words) [view diff] no match in snippet view article find links to article
of solving problems using an indirect and creative approach via reasoning that is not immediately obvious. Synonymous to thinking outside the box, it involves
Newcomb's paradox (2,284 words) [view diff] no match in snippet view article find links to article
also known as Newcomb's problem, is a thought experiment involving a game between two players, one of whom is able to predict the future with near-certainty
Heuristic (computer science) (1,364 words) [view diff] no match in snippet view article
heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact
Black swan theory (2,648 words) [view diff] no match in snippet view article find links to article
Taleb's "black swan theory" (which differs from the earlier philosophical versions of the problem) refers only to statistically unexpected events of
Closed-form expression (1,764 words) [view diff] no match in snippet view article find links to article
functions that have a closed form are called elementary functions. The closed-form problem arises when new ways are introduced for specifying mathematical
Naturalistic fallacy (2,800 words) [view diff] no match in snippet view article find links to article
the is–ought problem, which comes from David Hume's Treatise of Human Nature (1738–40); however, unlike Hume's view of the is–ought problem, Moore (and
Fringe theory (2,269 words) [view diff] no match in snippet view article find links to article
aspect of the demarcation problem that occurs within both science and the humanities. Geologist Steven Dutch approached the demarcation problem by dividing
♯P-complete (849 words) [view diff] no match in snippet view article find links to article
of the other problem to inputs of the given problem and from outputs of the given problem to outputs of the other problem, allowing the other problem to
Augustinian hypothesis (3,418 words) [view diff] no match in snippet view article find links to article
The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the
Nonlinear programming (1,483 words) [view diff] no match in snippet view article find links to article
programming (NLP) is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is
Sphere packing (3,419 words) [view diff] no match in snippet view article find links to article
However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in
Mutually orthogonal Latin squares (4,827 words) [view diff] no match in snippet view article find links to article
solve the problem, but in this work he demonstrated methods for constructing Graeco-Latin squares where n is odd or a multiple of 4. Observing that no order
Bad debt (1,468 words) [view diff] no match in snippet view article find links to article
provisioning. In the United States, bank loans with more than ninety days' arrears become "problem loans". Accounting sources advise that the full amount of
Problem of future contingents (2,354 words) [view diff] no match in snippet view article find links to article
statements about states of affairs in the future that are contingent: neither necessarily true nor necessarily false. The problem of future contingents seems to
Uninterpreted function (410 words) [view diff] no match in snippet view article find links to article
as equational theories. The satisfiability problem for free theories is solved by syntactic unification; algorithms for the latter are used by interpreters
Quantum complexity theory (3,632 words) [view diff] no match in snippet view article find links to article
selected from the set of all possible input strings. A promise problem is a pair A = ( A yes , A no ) {\displaystyle A=(A_{\text{yes}},A_{\text{no}})} , where
Inductive reasoning (8,642 words) [view diff] no match in snippet view article find links to article
first chapter is devoted to the problem of induction—opens, "I think I have solved a major philosophical problem: the problem of induction". In Popper's
Divide-and-conquer algorithm (2,894 words) [view diff] no match in snippet view article find links to article
a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems
Creativity (19,533 words) [view diff] no match in snippet view article find links to article
are no differences in the mechanisms underlying creativity from those used in normal problem solving, and in normal problem solving there is no need
Minesweeper (video game) (2,033 words) [view diff] no match in snippet view article
opened without opening a mine. There is no score, but there is a timer recording the time taken to finish the game. Difficulty can be increased by adding
Metaheuristic (4,643 words) [view diff] no match in snippet view article find links to article
combinatorial optimization, there are many problems that belong to the class of NP-complete problems and thus can no longer be solved exactly in an acceptable
Omnibenevolence (1,120 words) [view diff] no match in snippet view article find links to article
as a result of the problem of evil. However, some philosophers, such as Alvin Plantinga, argue the plausibility of co-existence. The word omnibenevolence
Shandong Problem (952 words) [view diff] no match in snippet view article find links to article
The Shandong Problem or Shandong Question (simplified Chinese: 山东问题; traditional Chinese: 山東問題; pinyin: Shāndōng wèntí; Japanese: 山東問題, romanized: Santō
Insight (3,892 words) [view diff] no match in snippet view article find links to article
understanding how to solve a difficult problem, is sometimes called by the German word Aha-Erlebnis. The term was coined by the German psychologist and theoretical
Regress argument (epistemology) (1,743 words) [view diff] no match in snippet view article
infinite regress. It is a problem in epistemology and in any general situation where a statement has to be justified. The argument is also known as diallelus
Natural evil (1,881 words) [view diff] no match in snippet view article find links to article
rebuttal to the free will defense against the theological problem of evil. The argument goes that the free will defense can only justify the presence of
Polynomial-time reduction (1,472 words) [view diff] no match in snippet view article find links to article
the first problem is no more difficult than the second one, because whenever an efficient algorithm exists for the second problem, one exists for the
Distributed computing (6,666 words) [view diff] no match in snippet view article find links to article
have a common goal, such as solving a large computational problem; the user then perceives the collection of autonomous processors as a unit. Alternatively
Kepler conjecture (2,718 words) [view diff] no match in snippet view article find links to article
was taken by László Fejes Tóth. Fejes Tóth (1953) showed that the problem of determining the maximum density of all arrangements (regular and irregular)
Experience (10,684 words) [view diff] no match in snippet view article find links to article
experience is involved in the mind–body problem and the hard problem of consciousness, both of which try to explain the relation between matter and
Psychophysical parallelism (1,430 words) [view diff] no match in snippet view article find links to article
Cambridge University Press. p. 762. Broad 1925, Chapter III: The Traditional Problem of Body and Mind. Donaldson, John (2018). "Mental Causation". Oxford
N/A (782 words) [view diff] no match in snippet view article find links to article
was one for which no answer would be applicable to certain persons filling out the form. Before programmers became aware of a problem with a particular
Structure (mathematical logic) (5,097 words) [view diff] no match in snippet view article
show that no such homomorphism exists. Every constraint satisfaction problem (CSP) has a translation into the homomorphism problem. Therefore, the complexity
Wild Animal Ethics (1,107 words) [view diff] no match in snippet view article find links to article
Wild Animal Ethics: The Moral and Political Problem of Wild Animal Suffering is a 2020 book by the philosopher Kyle Johannsen. It examines whether humans
Decidability (logic) (1,887 words) [view diff] no match in snippet view article
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional
Wireless network (3,598 words) [view diff] no match in snippet view article find links to article
can cause the signal to cancel out each other at certain locations, and to be stronger in other places (upfade). The hidden node problem occurs in some
Public policy (7,917 words) [view diff] no match in snippet view article find links to article
divides the policy process into a series of stages, from a notional starting point at which policymakers begin to think about a policy problem to a notional
Graph automorphism (1,343 words) [view diff] no match in snippet view article find links to article
The easier problem of testing whether a graph has any symmetries (nontrivial automorphisms), known as the graph automorphism problem, also has no known
Free logic (973 words) [view diff] no match in snippet view article find links to article
identical with Pegasus is Pegasus' that something is identical with Pegasus. The problem comes from substituting nondesignating constants for variables: in fact
Coincidence (1,366 words) [view diff] no match in snippet view article find links to article
underestimated probability. An example is the birthday problem, which shows that the probability of two persons having the same birthday already exceeds 50% in
Alcoholism (16,234 words) [view diff] no match in snippet view article find links to article
Alcoholism is the continued drinking of alcohol despite it causing problems. Some definitions require evidence of dependence and withdrawal. Problematic
Consciousness (19,944 words) [view diff] no match in snippet view article find links to article
fully be known from the inside, subjectively. The problem of other minds is a philosophical problem traditionally stated as the following epistemological
Problem of the criterion (392 words) [view diff] no match in snippet view article find links to article
In the field of epistemology, the problem of the criterion is an issue regarding the starting point of knowledge. This is a separate and more fundamental
Path (graph theory) (1,175 words) [view diff] no match in snippet view article
used to find the shortest paths between all pairs of vertices in weighted directed graphs. The k-path partition problem is the problem of partitioning
Irenaean theodicy (4,990 words) [view diff] no match in snippet view article find links to article
The Irenaean theodicy is a Christian theodicy (a response to the problem of evil). It defends the probability of an omnipotent and omnibenevolent (all-powerful
Experience (10,684 words) [view diff] no match in snippet view article find links to article
experience is involved in the mind–body problem and the hard problem of consciousness, both of which try to explain the relation between matter and
Coping (5,425 words) [view diff] no match in snippet view article find links to article
cause of their problem. They do this by finding out information on the problem and learning new skills to manage the problem. Problem-focused coping is
Sustainability and systemic change resistance (3,746 words) [view diff] no match in snippet view article find links to article
The environmental sustainability problem has proven difficult to solve. The modern environmental movement has attempted to solve the problem in a large
Black swan theory (2,648 words) [view diff] no match in snippet view article find links to article
Taleb's "black swan theory" (which differs from the earlier philosophical versions of the problem) refers only to statistically unexpected events of
Reinforcement learning (8,193 words) [view diff] no match in snippet view article find links to article
that maximizes the expected cumulative reward. Formulating the problem as a Markov decision process assumes the agent directly observes the current environmental
Creativity (19,533 words) [view diff] no match in snippet view article find links to article
are no differences in the mechanisms underlying creativity from those used in normal problem solving, and in normal problem solving there is no need
Lambda-CDM model (10,917 words) [view diff] no match in snippet view article find links to article
et al. (Particle Data Group) (2020). "Cosmological Parameters" (PDF). Prog. Theor. Exp. Phys. 083C01. Ostriker, J. P.; Steinhardt, P. J. (1995). "Cosmic Concordance"
Erectile dysfunction (7,489 words) [view diff] no match in snippet view article find links to article
It is the most common sexual problem in males and can cause psychological distress due to its impact on self-image and sexual relationships. The majority
Bernstein–Vazirani algorithm (1,225 words) [view diff] no match in snippet view article find links to article
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in
God's Problem Child (1,279 words) [view diff] no match in snippet view article find links to article
Problem Child is the 66th solo studio album by American singer-songwriter Willie Nelson. It was released on April 28, 2017, by Legacy Recordings. The
Decidability (logic) (1,887 words) [view diff] no match in snippet view article
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional
Decision-making (8,884 words) [view diff] no match in snippet view article find links to article
published under the label problem solving, particularly in European psychological research. Decision-making can be regarded as a problem-solving activity
Computability theory (6,414 words) [view diff] no match in snippet view article find links to article
tenth problem has no effective solution; this problem asked whether there is an effective procedure to decide whether a Diophantine equation over the integers
Closed-form expression (1,764 words) [view diff] no match in snippet view article find links to article
functions that have a closed form are called elementary functions. The closed-form problem arises when new ways are introduced for specifying mathematical
Mental disorder (21,963 words) [view diff] no match in snippet view article find links to article
a mental health problem in their lifetime, in comparison to 1 in 4 of the general population that suffers from a mental health problem in their lifetimes
Kissing number (2,204 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics What is the maximum possible kissing number for n-dimensional spheres in (n + 1)-dimensional Euclidean space? More unsolved
Cash flow (1,062 words) [view diff] no match in snippet view article find links to article
models such as internal rate of return and net present value. to determine problems with a business's liquidity. Being profitable does not necessarily mean
Problem Child (film) (3,115 words) [view diff] no match in snippet view article
Problem Child is a 1990 American black comedy film directed by Dennis Dugan in his feature film directorial debut and produced by Robert Simonds. The
QMA (1,832 words) [view diff] no match in snippet view article find links to article
also called the ground state energy of the Hamiltonian. The decision version of the k-local Hamiltonian problem is a type of promise problem and is defined
Income and fertility (4,013 words) [view diff] no match in snippet view article find links to article
lead to a variety of problems. See for example the demographics of Japan. Some scholars have observed a dramatic increase in the proportion of young adults
Augustinian hypothesis (3,418 words) [view diff] no match in snippet view article find links to article
The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the
Bouldering (3,401 words) [view diff] no match in snippet view article find links to article
six metres (20 ft) tall. Traverses, which are a form of boulder problem, require the climber to climb horizontally from one end to another. Artificial
Problem-based learning (8,001 words) [view diff] no match in snippet view article find links to article
Problem-based learning (PBL) is a teaching method in which students learn about a subject through the experience of solving an open-ended problem found
Simulated annealing (4,638 words) [view diff] no match in snippet view article find links to article
optimization problem. For large numbers of local optima, SA can find the global optimum. It is often used when the search space is discrete (for example the traveling
Distributed computing (6,666 words) [view diff] no match in snippet view article find links to article
have a common goal, such as solving a large computational problem; the user then perceives the collection of autonomous processors as a unit. Alternatively
White paper (1,649 words) [view diff] no match in snippet view article find links to article
presents the issuing body's philosophy on the matter. It is meant to help readers understand an issue, solve a problem, or make a decision. Since the 1990s
Lychrel number (2,122 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics Do any base-10 Lychrel numbers exist? More unsolved problems in mathematics A Lychrel number is a natural number that
No free lunch in search and optimization (3,264 words) [view diff] no match in snippet view article find links to article
complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding
Foundations of mathematics (6,910 words) [view diff] no match in snippet view article find links to article
showed that the axiom of choice is unprovable in ZF even without urelements. 1970: Hilbert's tenth problem is proven unsolvable: there is no recursive solution
Social novel (5,390 words) [view diff] no match in snippet view article find links to article
The social novel, also known as the social problem (or social protest) novel, is a "work of fiction in which a prevailing social problem, such as gender
Neumann boundary condition (520 words) [view diff] no match in snippet view article find links to article
equation, the condition specifies the values of the derivative applied at the boundary of the domain. It is possible to describe the problem using other
Quantum complexity theory (3,632 words) [view diff] no match in snippet view article find links to article
selected from the set of all possible input strings. A promise problem is a pair A = ( A yes , A no ) {\displaystyle A=(A_{\text{yes}},A_{\text{no}})} , where
Omnipotence paradox (4,770 words) [view diff] no match in snippet view article find links to article
false dilemma, as it neglects the possibility of varying degrees of omnipotence. Some modern approaches to the problem have involved semantic debates
Job-shop scheduling (2,578 words) [view diff] no match in snippet view article find links to article
Job-shop scheduling, the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research
Condition number (2,453 words) [view diff] no match in snippet view article find links to article
the value of the asymptotic worst-case relative change in output for a relative change in input. The "function" is the solution of a problem and the "arguments"
No Problem (2010 film) (1,227 words) [view diff] no match in snippet view article
No Problem is a 2010 Indian Hindi-language action comedy film directed by Anees Bazmee and produced by Rajat Rawail and Anil Kapoor. The film stars Kapoor
Multi-armed bandit (7,667 words) [view diff] no match in snippet view article find links to article
theory and machine learning, the multi-armed bandit problem (sometimes called the K- or N-armed bandit problem) is a problem in which a decision maker iteratively
Uninterpreted function (410 words) [view diff] no match in snippet view article find links to article
as equational theories. The satisfiability problem for free theories is solved by syntactic unification; algorithms for the latter are used by interpreters
Tautology (logic) (3,114 words) [view diff] no match in snippet view article
that (equivalently for all NP-complete problems) no polynomial-time algorithm can solve the satisfiability problem, although some algorithms perform well
Euthyphro dilemma (9,164 words) [view diff] no match in snippet view article find links to article
which is loved by the gods (τὸ θεοφιλές), but Socrates finds a problem with this proposal: the gods may disagree among themselves (7e). Euthyphro then revises
Strong CP problem (1,511 words) [view diff] no match in snippet view article find links to article
The strong CP problem is a question in particle physics, which brings up the following quandary: why does quantum chromodynamics (QCD) seem to preserve
Derangement (2,212 words) [view diff] no match in snippet view article find links to article
that no letter appears in the correctly addressed envelope. Counting derangements of a set amounts to the hat-check problem, in which one considers the number
Cooperative bargaining (2,002 words) [view diff] no match in snippet view article find links to article
surplus-sharing problems (also called bargaining problem) are faced by management and labor in the division of a firm's profit, by trade partners in the specification
Word problem for groups (4,932 words) [view diff] no match in snippet view article find links to article
especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G {\displaystyle G} is the algorithmic
Problem of religious language (6,252 words) [view diff] no match in snippet view article find links to article
The problem of religious language considers whether it is possible to talk about God meaningfully if the traditional conceptions of God as being incorporeal
Explanatory gap (1,609 words) [view diff] no match in snippet view article find links to article
explanation for experience and qualia) is known as "the hard problem". The hardness of the problem is such that mysterians believe it can never be solved
Greedy algorithm (1,918 words) [view diff] no match in snippet view article find links to article
any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not
Theory of forms (5,325 words) [view diff] no match in snippet view article find links to article
understanding about every problem ..." (with regard to "the course of scrutiny") – The Seventh Letter 344b. Unfortunately the hidden world can in no way be verified
Bootstrapping (3,490 words) [view diff] no match in snippet view article find links to article
solves the problem of how to create a better precise flat surface. Bootstrapping is using very general consistency criteria to determine the form of
Theory of forms (5,325 words) [view diff] no match in snippet view article find links to article
understanding about every problem ..." (with regard to "the course of scrutiny") – The Seventh Letter 344b. Unfortunately the hidden world can in no way be verified
Neumann boundary condition (520 words) [view diff] no match in snippet view article find links to article
equation, the condition specifies the values of the derivative applied at the boundary of the domain. It is possible to describe the problem using other
Condition number (2,453 words) [view diff] no match in snippet view article find links to article
the value of the asymptotic worst-case relative change in output for a relative change in input. The "function" is the solution of a problem and the "arguments"
Foundations of mathematics (6,910 words) [view diff] no match in snippet view article find links to article
showed that the axiom of choice is unprovable in ZF even without urelements. 1970: Hilbert's tenth problem is proven unsolvable: there is no recursive solution
Job-shop scheduling (2,578 words) [view diff] no match in snippet view article find links to article
Job-shop scheduling, the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research
Problem of the creator of God (1,323 words) [view diff] no match in snippet view article find links to article
In philosophy, the problem of the creator of God is the controversy regarding the hypothetical cause responsible for the existence of God, assuming God
Dijkstra's algorithm (5,637 words) [view diff] no match in snippet view article find links to article
is the list of vertices constituting one of the shortest paths from source to target, or the empty sequence if no path exists. A more general problem is
Oppositional defiant disorder (6,408 words) [view diff] no match in snippet view article find links to article
child-focused problem-solving skills training program, and self-monitoring skills. Anger control and stress inoculation help prepare the child for possible
The Problem Solvers (2,888 words) [view diff] no match in snippet view article find links to article
"The Problem Solvers" is the fifth episode of the fourth season of the American television comedy series 30 Rock, and the 63rd overall episode of the series
Derangement (2,212 words) [view diff] no match in snippet view article find links to article
that no letter appears in the correctly addressed envelope. Counting derangements of a set amounts to the hat-check problem, in which one considers the number
Newton's law of universal gravitation (3,839 words) [view diff] no match in snippet view article find links to article
background to the n-body problem; Section 2: Celestial Mechanics (Chapter 1, The Uniformization of the Three-body Problem (Restricted Three-body Problem); Chapter
Lychrel number (2,122 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics Do any base-10 Lychrel numbers exist? More unsolved problems in mathematics A Lychrel number is a natural number that
IPv4 address exhaustion (6,434 words) [view diff] no match in snippet view article find links to article
exhaustion started with the recognition of the problem in the early 1990s, and the introduction of a number of stop-gap refinements to make the existing structure
Manchuria–Mongolia problem (133 words) [view diff] no match in snippet view article find links to article
The Manchuria-Mongolia problem (Japanese: 満蒙問題, Hepburn: manmō mondai) refers to a set of issues concerning Imperial Japan's protection of its special
Personal identity (7,119 words) [view diff] no match in snippet view article find links to article
personal identity is referred to as the diachronic problem of personal identity. The synchronic problem concerns the question of what features and traits
Bin packing problem (7,097 words) [view diff] no match in snippet view article find links to article
The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of
Eigenvalues and eigenvectors (13,617 words) [view diff] no match in snippet view article find links to article
summation of the eigenvectors. The eigenvalue problem of complex structures is often solved using finite element analysis, but neatly generalize the solution
Cooperative bargaining (2,002 words) [view diff] no match in snippet view article find links to article
surplus-sharing problems (also called bargaining problem) are faced by management and labor in the division of a firm's profit, by trade partners in the specification
Hilbert's fifth problem (1,077 words) [view diff] no match in snippet view article find links to article
Hilbert's fifth problem is the fifth mathematical problem from the problem list publicized in 1900 by mathematician David Hilbert, and concerns the characterization
Turing machine (9,420 words) [view diff] no match in snippet view article find links to article
This is due to the fact that the halting problem is unsolvable, which has major implications for the theoretical limits of computing. The Turing machine
Problem of religious language (6,252 words) [view diff] no match in snippet view article find links to article
The problem of religious language considers whether it is possible to talk about God meaningfully if the traditional conceptions of God as being incorporeal
Strong CP problem (1,511 words) [view diff] no match in snippet view article find links to article
The strong CP problem is a question in particle physics, which brings up the following quandary: why does quantum chromodynamics (QCD) seem to preserve
CP violation (7,704 words) [view diff] no match in snippet view article find links to article
important to the matter-antimatter asymmetry problem, the strong CP problem, and in the study of weak interactions in particle physics. Under the CPT theorem
Socrates (11,564 words) [view diff] no match in snippet view article find links to article
known as the Socratic problem. Socrates was a polarizing figure in Athenian society. In 399 BC, he was accused of impiety and corrupting the youth. After
Explanatory gap (1,609 words) [view diff] no match in snippet view article find links to article
explanation for experience and qualia) is known as "the hard problem". The hardness of the problem is such that mysterians believe it can never be solved
Blending inheritance (1,319 words) [view diff] no match in snippet view article find links to article
generation would be more uniform than the one before, and that Darwin should have said as much to Jenkin. The problem was not with natural selection, but
Hungarian Revolution of 1956 (18,643 words) [view diff] no match in snippet view article find links to article
Nations: Report of the Special Committee on the Problem of Hungary, General Assembly, Official Records, Eleventh Session, Supplement No. 18 (A/3592), New
Harmonic series (mathematics) (6,219 words) [view diff] no match in snippet view article
numbers, the analysis of the coupon collector's problem on how many random trials are needed to provide a complete range of responses, the connected
New riddle of induction (3,876 words) [view diff] no match in snippet view article find links to article
The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem. It presents the
How Do You Solve a Problem like Maria? (4,558 words) [view diff] no match in snippet view article find links to article
Problem like Maria? is a British reality television talent show that documented the search for an undiscovered musical theatre performer to play the role
Music for Pleasure (The Damned album) (826 words) [view diff] no match in snippet view article
sound of their debut album. The sleeve was designed by Barney Bubbles (including the cover painting). The song "Problem Child" was released on 30 September
Quantum optimization algorithms (3,576 words) [view diff] no match in snippet view article find links to article
Mostly, the optimization problem is formulated as a minimization problem, where one tries to minimize an error which depends on the solution: the optimal
Scarcity (2,949 words) [view diff] no match in snippet view article find links to article
the conditions of scarcity did not exist and an "infinite amount of every good could be produced or human wants fully satisfied ... there would be no
Galaxy rotation curve (4,706 words) [view diff] no match in snippet view article find links to article
the velocity observations. The galaxy rotation problem is the discrepancy between observed galaxy rotation curves and the theoretical prediction, assuming
AI alignment (12,973 words) [view diff] no match in snippet view article find links to article
open problem. The alignment problem has many parallels with the principal-agent problem in organizational economics. In a principal-agent problem, a principal
Social-desirability bias (3,164 words) [view diff] no match in snippet view article find links to article
undesirable behavior. The tendency poses a serious problem with conducting research with self-reports. This bias interferes with the interpretation of average
Louis Nirenberg (5,007 words) [view diff] no match in snippet view article find links to article
Math. 30 (1977), no. 1, 41–68. Cheng, Shiu Yuen; Yau, Shing Tung. On the regularity of the solution of the n-dimensional Minkowski problem. Comm. Pure Appl
Baryon asymmetry (2,378 words) [view diff] no match in snippet view article find links to article
Unsolved problem in physics What is the source of imbalance of matter and antimatter? This refers to the small non-zero value of baryons over photons
Quantum supremacy (5,929 words) [view diff] no match in snippet view article find links to article
supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in
One-child policy (20,774 words) [view diff] no match in snippet view article find links to article
presents the urgency of the population problem as well as justifies the necessity of mandatory birth control across the nation. Due to the previous traumas
Henri Poincaré (11,422 words) [view diff] no match in snippet view article find links to article
In his research on the three-body problem, Poincaré became the first person to discover a chaotic deterministic system which laid the foundations of modern
Michael Huemer (1,014 words) [view diff] no match in snippet view article find links to article
Philosophy and Phenomenological Research, and Mind. In 2013, he published The Problem of Political Authority, in which he argues that modern arguments for
Eureka effect (4,968 words) [view diff] no match in snippet view article find links to article
suddenly understanding a previously incomprehensible problem or concept. Some research describes the Aha! effect (also known as insight or epiphany) as
Programme for the International Assessment of Adult Competencies (2,768 words) [view diff] no match in snippet view article find links to article
skills. The main aim is to be able to assess the skills of literacy, numeracy and problem solving in technology-rich environments, and use the collected
Buffon's needle problem (4,303 words) [view diff] no match in snippet view article find links to article
In probability theory, Buffon's needle problem is a question first posed in the 18th century by Georges-Louis Leclerc, Comte de Buffon: Suppose we have
Many-worlds interpretation (8,371 words) [view diff] no match in snippet view article find links to article
is intended to resolve the measurement problem and thus some paradoxes of quantum theory, such as Wigner's friend,: 4–6  the EPR paradox: 462 : 118 
Odyssey of the Mind (3,646 words) [view diff] no match in snippet view article find links to article
Odyssey of the Mind, abbreviated OM or OotM, is a creative problem-solving program where team members present their solution at a competition to a predefined
Numerical analysis (3,919 words) [view diff] no match in snippet view article find links to article
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis
Unknotting problem (1,398 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics Can unknots be recognized in polynomial time? More unsolved problems in mathematics In mathematics, the unknotting problem is
Dedekind number (2,046 words) [view diff] no match in snippet view article find links to article
summation are known. However Dedekind's problem of computing the values of M ( n ) {\displaystyle M(n)} remains difficult: no closed-form expression for M ( n
Odyssey of the Mind (3,646 words) [view diff] no match in snippet view article find links to article
Odyssey of the Mind, abbreviated OM or OotM, is a creative problem-solving program where team members present their solution at a competition to a predefined
Tunneling protocol (1,956 words) [view diff] no match in snippet view article find links to article
and port originating from the   opposing (remote or local, as previously) host. The TCP meltdown problem is often not a problem when using OpenSSH's port
Numerical analysis (3,919 words) [view diff] no match in snippet view article find links to article
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis
Dedekind number (2,046 words) [view diff] no match in snippet view article find links to article
summation are known. However Dedekind's problem of computing the values of M ( n ) {\displaystyle M(n)} remains difficult: no closed-form expression for M ( n
Differential evolution (1,589 words) [view diff] no match in snippet view article find links to article
commonly known as metaheuristics as they make few or no assumptions about the optimized problem and can search very large spaces of candidate solutions
Buffon's needle problem (4,303 words) [view diff] no match in snippet view article find links to article
In probability theory, Buffon's needle problem is a question first posed in the 18th century by Georges-Louis Leclerc, Comte de Buffon: Suppose we have
Resource allocation (523 words) [view diff] no match in snippet view article find links to article
relates to consumer preferences in an economy Collective problem solving – Approaches to problem solvingPages displaying short descriptions of redirect
Two-gospel hypothesis (2,427 words) [view diff] no match in snippet view article find links to article
than the Gospel of Mark. It is a proposed solution to the synoptic problem, which concerns the pattern of similarities and differences between the three
Multi-objective optimization (9,569 words) [view diff] no match in snippet view article find links to article
multi-objective optimization problem, it is not guaranteed that a single solution simultaneously optimizes each objective. The objective functions are said
Gestalt psychology (6,226 words) [view diff] no match in snippet view article find links to article
theorists, that animals can learn by "sudden insight" into the "structure" of a problem, over and above the associative and incremental manner of learning that
General Problem Solver (481 words) [view diff] no match in snippet view article find links to article
a universal problem solver machine. In contrast to the former Logic Theorist project, the GPS works with means–ends analysis. Any problem that can be
User error (1,801 words) [view diff] no match in snippet view article find links to article
interaction practitioners, the more formal term human error is used in the context of human reliability. Related terms such as PEBKAC ("problem exists between keyboard
Search algorithm (1,453 words) [view diff] no match in snippet view article find links to article
search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain
Fanaticism (744 words) [view diff] no match in snippet view article find links to article
Each behavior is obvious once it is pointed out; a closed mind, no interest in debating the subject of worship, and over reaction to people who do not believe
Travis Tomko (3,408 words) [view diff] no match in snippet view article find links to article
match on Christian's behalf and helping him pick up the win. His gimmick was that of "The Problem Solver", and acting as an "enforcer for hire" for Christian
A Penguin's Troubles (1,536 words) [view diff] no match in snippet view article find links to article
Lunch A Problem of a Hero A Problem of Bowling A Problem of Escaping A Problem of Toilets A Problem of the Future A Problem of Swimming A Problem of Parting
Problem Child (TV series) (589 words) [view diff] no match in snippet view article
based on the Problem Child films. The series was first premiered on USA Network (part of USA Cartoon Express block) in October 31, 1993 until the final episode's
Externality (10,668 words) [view diff] no match in snippet view article find links to article
Solution to the Problem of Externalities When Agents Are Well Informed". The American Economic Review. Vol. 84 No. 5. Marney, G.A. (1971). "The ‘Coase Theorem:'
Bill Nye (7,548 words) [view diff] no match in snippet view article find links to article
Solve Any Problem. Emmaus, Pennsylvania: Rodale Books. ISBN 978-1623367916. Jack and the Geniuses at the Bottom of the World (2017) Jack and the Geniuses
Problem at Pollensa Bay and Other Stories (525 words) [view diff] no match in snippet view article find links to article
Problem at Pollensa Bay and Other Stories is a short story collection by Agatha Christie published in the UK only in November 1991 by HarperCollins. It
Shakespeare's plays (4,993 words) [view diff] no match in snippet view article find links to article
histories follows the categories used in the First Folio. However, modern criticism has labelled some of these plays "problem plays" that elude easy categorisation
Mark 15 torpedo (970 words) [view diff] no match in snippet view article find links to article
Newport and at the Naval Ordnance Station Forest Park, Illinois. The Mark 15 had the same basic design problems that plagued the Mark 14 for the first 20 months
Bipartite graph (4,086 words) [view diff] no match in snippet view article find links to article
differing colors, as is required in the graph coloring problem. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such
The Final Problem (3,485 words) [view diff] no match in snippet view article find links to article
"The Final Problem" is a short story by Sir Arthur Conan Doyle featuring his detective character Sherlock Holmes. It was first published in The Strand
Riesel number (1,872 words) [view diff] no match in snippet view article find links to article
that the number 509203 has this property, as does 509203 plus any positive integer multiple of 11184810. The Riesel problem consists in determining the smallest
Groupthink (8,830 words) [view diff] no match in snippet view article find links to article
(2004-11-08). "Groups of diverse problem solvers can outperform groups of high-ability problem solvers". Proceedings of the National Academy of Sciences.
Coin flipping (4,329 words) [view diff] no match in snippet view article find links to article
(11 December 2002). "The Problem of Thinking Too Much" (PDF). Department of Statistics, Stanford University. Archived from the original (PDF) on 19 October
A Problem from Hell (859 words) [view diff] no match in snippet view article find links to article
"A Problem from Hell": America and the Age of Genocide (2002) is a book by American Samantha Power, at that time Professor of Human Rights Practice at
Q source (4,506 words) [view diff] no match in snippet view article find links to article
treatment of the synoptic problem in 1863, and the two-source hypothesis has dominated ever since. At this time, the second source was usually called the Logia
Yang–Mills existence and mass gap (1,867 words) [view diff] no match in snippet view article find links to article
The Yang–Mills existence and mass gap problem is an unsolved problem in mathematical physics and mathematics, and one of the seven Millennium Prize Problems
Speech disorder (1,752 words) [view diff] no match in snippet view article find links to article
language problems. There are three different levels of classification when determining the magnitude and type of a speech disorder and the proper treatment
Mental event (890 words) [view diff] no match in snippet view article find links to article
identity even makes sense, is central to the mind–body problem. Some state that the mental and the physical are the very same property which cause any event(s)
Constraint programming (2,324 words) [view diff] no match in snippet view article find links to article
customized code like a problem-specific branching heuristic. Constraint programming takes its root from and can be expressed in the form of constraint logic
Eye disease (1,672 words) [view diff] no match in snippet view article find links to article
International Statistical Classification of Diseases and Related Health Problems, or ICD-10. This list uses that classification. (H02.1) Ectropion (H02
Independence (mathematical logic) (519 words) [view diff] no match in snippet view article
is unrelated to the idea of "decidability" as in a decision problem.) A theory T is independent if no axiom in T is provable from the remaining axioms
The Problem with a Poo (1,014 words) [view diff] no match in snippet view article find links to article
"The Problem with a Poo" is the third episode of the twenty-second season of the American animated television series South Park. The 290th overall episode
Metrizable space (865 words) [view diff] no match in snippet view article find links to article
Archived from the original (PDF) on 2011-09-25. Retrieved 2012-08-08. Neeb, Karl-Hermann, On a theorem of S. Banach. J. Lie Theory 7 (1997), no. 2, 293–300
Busy beaver (7,914 words) [view diff] no match in snippet view article find links to article
function. This has implications in computability theory, the halting problem, and complexity theory. The concept of a busy beaver was first introduced by Tibor
Triangular number (3,594 words) [view diff] no match in snippet view article find links to article
also equivalent to the handshake problem and fully connected network problems. One way of calculating the depreciation of an asset is the sum-of-years' digits
Fermi–Pasta–Ulam–Tsingou problem (3,118 words) [view diff] no match in snippet view article find links to article
In physics, the Fermi–Pasta–Ulam–Tsingou (FPUT) problem or formerly the Fermi–Pasta–Ulam problem was the apparent paradox in chaos theory that many complicated
Logic puzzle (517 words) [view diff] no match in snippet view article find links to article
Carroll, the author of Alice's Adventures in Wonderland. In his book The Game of Logic he introduced a game to solve problems such as confirming the conclusion
Fifth column (4,828 words) [view diff] no match in snippet view article find links to article
and when the French premier Paul Reynaud announced that "the bridges over the Meuse had been betrayed", a BBC employee wrote, "I have no doubt that
Steiner tree problem (4,434 words) [view diff] no match in snippet view article find links to article
mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial
Dominating set (4,082 words) [view diff] no match in snippet view article find links to article
classical NP-complete decision problem in computational complexity theory. Therefore it is believed that there may be no efficient algorithm that can compute
Triangle-free graph (2,524 words) [view diff] no match in snippet view article find links to article
the numbers of vertices on each side of the bipartition are as equal as possible. The triangle finding or triangle detection problem is the problem of
Dolomite (rock) (3,407 words) [view diff] no match in snippet view article
dolomitic limestone. The "dolomite problem" refers to the vast worldwide depositions of dolomite in the past geologic record in contrast to the limited amounts
Child sexual abuse (19,262 words) [view diff] no match in snippet view article find links to article
costs for the former. Intergenerational effects have been noted, with the children of victims of child sexual abuse exhibiting more conduct problems, peer
Argument from nonbelief (4,558 words) [view diff] no match in snippet view article find links to article
there is a problem about God's liability for what is created. More fundamentally in relation to Murray's argument, there is the problem for orthodox
FIDE titles (3,169 words) [view diff] no match in snippet view article find links to article
trainers. Titles for correspondence chess, chess problem composition and chess problem solving are no longer administered by FIDE. A chess title, usually
Double-spending (1,042 words) [view diff] no match in snippet view article find links to article
Double-spending is the unauthorized production and spending of money, either digital or conventional. It represents a monetary design problem: a good money
Independence (mathematical logic) (519 words) [view diff] no match in snippet view article
is unrelated to the idea of "decidability" as in a decision problem.) A theory T is independent if no axiom in T is provable from the remaining axioms
Augustinian theodicy (4,670 words) [view diff] no match in snippet view article find links to article
Christian theodicy that developed in response to the evidential problem of evil. As such, it attempts to explain the probability of an omnipotent (all-powerful)
Subset sum problem (3,781 words) [view diff] no match in snippet view article find links to article
The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset S {\displaystyle S} of integers
FP (complexity) (354 words) [view diff] no match in snippet view article
computers without randomization. The difference between FP and P is that problems in P have one-bit, yes/no answers, while problems in FP can have any output
Fermi–Pasta–Ulam–Tsingou problem (3,118 words) [view diff] no match in snippet view article find links to article
In physics, the Fermi–Pasta–Ulam–Tsingou (FPUT) problem or formerly the Fermi–Pasta–Ulam problem was the apparent paradox in chaos theory that many complicated
List of paradoxes (7,937 words) [view diff] no match in snippet view article find links to article
Successfully fixing a problem with a defective product may lead to higher consumer satisfaction than in the case where no problem occurred at all. St.
Fate of the unlearned (3,825 words) [view diff] no match in snippet view article find links to article
argument against the existence of God, and is generally accepted to be an extension or sub-section of the problem of evil. In the Bible, Paul the Apostle teaches
Chinese room (12,759 words) [view diff] no match in snippet view article find links to article
version of the problem of other minds, applied to machines. There is no way we can determine if other people's subjective experience is the same as our
Isoperimetric inequality (3,479 words) [view diff] no match in snippet view article find links to article
that equality holds if and only if the curve is a circle. The isoperimetric problem is to determine a plane figure of the largest possible area whose boundary
Sorites paradox (4,699 words) [view diff] no match in snippet view article find links to article
is to use a multi-valued logic. In this context, the problem is with the principle of bivalence: the sand is either a heap or is not a heap, without any
Steiner tree problem (4,434 words) [view diff] no match in snippet view article find links to article
mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial
Double-spending (1,042 words) [view diff] no match in snippet view article find links to article
Double-spending is the unauthorized production and spending of money, either digital or conventional. It represents a monetary design problem: a good money
Analysis paralysis (1,737 words) [view diff] no match in snippet view article find links to article
potentially larger problem may arise. A person may desire a perfect solution, but may fear making a decision that could result in error, while on the way to a better
Computational complexity (3,016 words) [view diff] no match in snippet view article find links to article
measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms
Computability (3,293 words) [view diff] no match in snippet view article find links to article
is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic and the theory
Slavery in Oman (3,394 words) [view diff] no match in snippet view article find links to article
Global Problem, p. 265-66 Suzanne Miers: Slavery in the Twentieth Century: The Evolution of a Global Problem, p. 304-07 Women and Slavery: Africa, the Indian
Kurds in Turkey (8,143 words) [view diff] no match in snippet view article find links to article
under the Criminal Code." From the 1994 briefing at the International Human Rights Law Group: "the problem in Turkey is the Constitution is against the Kurds
BPP (complexity) (2,456 words) [view diff] no match in snippet view article
science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable by a probabilistic Turing machine in polynomial time
Sleeping Beauty problem (2,577 words) [view diff] no match in snippet view article find links to article
The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, is a puzzle in decision theory in which an ideally rational epistemic agent is
Multiple inheritance (2,457 words) [view diff] no match in snippet view article find links to article
to its increased complexity and ambiguity in situations such as the "diamond problem", where it may be ambiguous as to which parent class a particular
Correspondence problem (861 words) [view diff] no match in snippet view article find links to article
The correspondence problem refers to the problem of ascertaining which parts of one image correspond to which parts of another image, where differences
Problem Children Are Coming from Another World, Aren't They? (1,456 words) [view diff] no match in snippet view article find links to article
Problem Children are Coming from Another World, aren't they? (Japanese: 問題児たちが異世界から来るそうですよ?, Hepburn: Mondaiji-tachi ga Isekai Kara Kuru Sō Desu yo?)
Indigo (Chris Brown album) (4,593 words) [view diff] no match in snippet view article
Nicki Minaj and G-Eazy, "No Guidance", featuring Drake, and "Heat", featuring Gunna. "No Guidance" was certified diamond by the Recording Industry Association
Apollo 13 (13,667 words) [view diff] no match in snippet view article find links to article
caused no problems, partly because of the extensive electrical insulation improvements instituted after the Apollo 1 fire. Despite all this, the crew voiced
Graph isomorphism problem (4,222 words) [view diff] no match in snippet view article find links to article
Unsolved problem in computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph
Anti-Indonesian sentiment (413 words) [view diff] no match in snippet view article find links to article
Despite the Australian government originally supporting Jakarta's policies, the East Timor issue created anti-Indonesian sentiment throughout the Australian
Moduli space (4,050 words) [view diff] no match in snippet view article find links to article
a universal space of parameters for the problem. For example, consider the problem of finding all circles in the Euclidean plane up to congruence. Any
Turing degree (3,130 words) [view diff] no match in snippet view article find links to article
decision problems. The Turing degree of a set is a measure of how difficult it is to solve the decision problem associated with the set, that is, to determine
Grover's algorithm (4,691 words) [view diff] no match in snippet view article find links to article
evaluations of the function, where N {\displaystyle N} is the size of the function's domain. It was devised by Lov Grover in 1996. The analogous problem in classical
Susan Pevensie (1,304 words) [view diff] no match in snippet view article find links to article
place in the Narnia books. Since the publication of Gaiman's story, "the problem of Susan" has become used more widely as a catchphrase for the literary
Fertility and intelligence (4,321 words) [view diff] no match in snippet view article find links to article
The low IQ may not be a problem; in the past, immigrants have sometimes shown large increases on such measures. But other evidence indicates that the
Action (philosophy) (4,901 words) [view diff] no match in snippet view article
or irrational depending on the reason for which they are performed. The problem of responsibility is closely related to the philosophy of actions since
Philosophical analysis (1,310 words) [view diff] no match in snippet view article find links to article
true if and only if the subject is in the extension of the predicate. The problem is that there is no present king of France, so the present king of France
Kirkman's schoolgirl problem (4,155 words) [view diff] no match in snippet view article find links to article
schoolgirl problem is a problem in combinatorics proposed by Thomas Penyngton Kirkman in 1850 as Query VI in The Lady's and Gentleman's Diary (pg.48). The problem
Hughesy, We Have a Problem (1,254 words) [view diff] no match in snippet view article find links to article
Hughesy, We Have a Problem was an Australian comedy panel television series which premiered on Network 10 on 30 January 2018. The program was hosted by
SL (complexity) (1,793 words) [view diff] no match in snippet view article
Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether
Mars 2MV-3 No.1 (432 words) [view diff] no match in snippet view article find links to article
part of the Mars program, and was intended to land on the surface of Mars. Due to a problem with the rocket which launched it, it did not depart low Earth
Neurological examination (956 words) [view diff] no match in snippet view article find links to article
If a problem is found either in an investigative or screening process, then further tests can be carried out to focus on a particular aspect of the nervous
Amnesia (6,764 words) [view diff] no match in snippet view article find links to article
modified. Other neurological problems are likely to be present in combination with this type of amnesia, such as problems with the medial temporal lobe and
List of NP-complete problems (2,746 words) [view diff] no match in snippet view article find links to article
there are thousands of such problems known, this list is in no way comprehensive. Many problems of this type can be found in Garey & Johnson (1979). Graphs
Mathematical problem (936 words) [view diff] no match in snippet view article find links to article
mathematical problem is a problem that can be represented, analyzed, and possibly solved, with the methods of mathematics. This can be a real-world problem, such
Great Vowel Shift (2,990 words) [view diff] no match in snippet view article find links to article
coined the term. The causes of the Great Vowel Shift are unknown: 68  and have been a source of intense scholarly debate; as yet, there is no firm consensus
Mind–body dualism (12,285 words) [view diff] no match in snippet view article find links to article
in the mind–body problem. Aristotle shared Plato's view of multiple souls and further elaborated a hierarchical arrangement, corresponding to the distinctive
Hill climbing (1,637 words) [view diff] no match in snippet view article find links to article
technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find
Knowledge (18,985 words) [view diff] no match in snippet view article find links to article
Ichikawa & Steup 2018, § 3. The Gettier Problem, § 10.2 Fake Barn Cases Ichikawa & Steup 2018, § 3. The Gettier Problem, § 4. No False Lemmas, § 5. Modal
Don't Shoot (The Game song) (206 words) [view diff] no match in snippet view article
by American rapper the Game featuring Rick Ross, 2 Chainz, Diddy, Fabolous, Wale, DJ Khaled, Swizz Beatz, Yo Gotti, Currensy, Problem, King Pharoah and
Well-posed problem (1,540 words) [view diff] no match in snippet view article find links to article
mathematics, a well-posed problem is one for which the following properties hold: The problem has a solution The solution is unique The solution's behavior
Integer partition (3,405 words) [view diff] no match in snippet view article find links to article
+ 1 The only partition of zero is the empty sum, having no parts. The order-dependent composition 1 + 3 is the same partition as 3 + 1, and the two distinct
Reduction (complexity) (1,658 words) [view diff] no match in snippet view article
transforming one problem into another problem. A sufficiently efficient reduction from one problem to another may be used to show that the second problem is at least
Ultraviolet catastrophe (1,050 words) [view diff] no match in snippet view article find links to article
spectrum, there was a problem. This problem was later found to be due to a property of quanta as proposed by Max Planck: There could be no fraction of a discrete
Collision detection (4,887 words) [view diff] no match in snippet view article find links to article
detection is the computational problem of detecting an intersection of two or more objects in virtual space. More precisely, it deals with the questions
1931 census of Palestine (361 words) [view diff] no match in snippet view article find links to article
Bahais, 182 Samaritans, and 421 reporting no religion. A special problem was posed by the nomadic Bedouin of the south, who were reluctant to co-operate
Factorization (7,863 words) [view diff] no match in snippet view article find links to article
factorization (see above) reduces the problem of searching for rational roots to the case of polynomials with integer coefficients having no non-trivial common divisor
Fertility and intelligence (4,321 words) [view diff] no match in snippet view article find links to article
The low IQ may not be a problem; in the past, immigrants have sometimes shown large increases on such measures. But other evidence indicates that the
Combinatorics (3,524 words) [view diff] no match in snippet view article find links to article
considered in isolation, giving an ad hoc solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general
Correspondence problem (861 words) [view diff] no match in snippet view article find links to article
The correspondence problem refers to the problem of ascertaining which parts of one image correspond to which parts of another image, where differences
Longest path problem (2,662 words) [view diff] no match in snippet view article find links to article
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph
Economic system (4,069 words) [view diff] no match in snippet view article find links to article
economic problem is anchored on the theory of pricing. The theory of pricing, in this context, has to do with the economic decision-making between the production
Axion (7,873 words) [view diff] no match in snippet view article find links to article
and Steven Weinberg as the Goldstone boson of Peccei–Quinn theory, which had been proposed in 1977 to solve the strong CP problem in quantum chromodynamics
International Mathematical Olympiad (4,197 words) [view diff] no match in snippet view article find links to article
Unlike other science olympiads, the IMO has no official syllabus and does not cover any university-level topics. The problems chosen are from various areas
Organizational founder (862 words) [view diff] no match in snippet view article find links to article
outgrows the ability of the founder, or even of a small team around the founder, to control". The Harvard Business Review identified this problem as the founder's
Bitcoin scalability problem (1,375 words) [view diff] no match in snippet view article find links to article
The Bitcoin scalability problem refers to the limited capability of the Bitcoin network to handle large amounts of transaction data on its platform in
List of NP-complete problems (2,746 words) [view diff] no match in snippet view article find links to article
there are thousands of such problems known, this list is in no way comprehensive. Many problems of this type can be found in Garey & Johnson (1979). Graphs
Sentence (mathematical logic) (461 words) [view diff] no match in snippet view article
theories problem. For the interpretation of formulas, consider these structures: the positive real numbers, the real numbers, and complex numbers. The following
Graham's number (2,541 words) [view diff] no match in snippet view article find links to article
number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than
Reduction (complexity) (1,658 words) [view diff] no match in snippet view article
transforming one problem into another problem. A sufficiently efficient reduction from one problem to another may be used to show that the second problem is at least
Respiratory disease (3,549 words) [view diff] no match in snippet view article find links to article
issues. Malignant tumors of the respiratory system, particularly primary carcinomas of the lung, are a major health problem responsible for 15% of all
Software design (2,647 words) [view diff] no match in snippet view article find links to article
concepts. Software design usually is directed by goals for the resulting system and involves problem-solving and planning – including both high-level software
Kirkman's schoolgirl problem (4,155 words) [view diff] no match in snippet view article find links to article
schoolgirl problem is a problem in combinatorics proposed by Thomas Penyngton Kirkman in 1850 as Query VI in The Lady's and Gentleman's Diary (pg.48). The problem
Thought experiment (8,179 words) [view diff] no match in snippet view article find links to article
No.242, (April 1952), pp. 222–233; Parry, W.T., "Reëxamination of the Problem of Counterfactual Conditionals", The Journal of Philosophy, Vol.54, No.4
Transportation theory (mathematics) (4,442 words) [view diff] no match in snippet view article
the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. In the
Criticism of socialism (4,655 words) [view diff] no match in snippet view article find links to article
should be criticized on theoretical grounds, such as in the economic calculation problem and the socialist calculation debate, while others hold that certain
Well-posed problem (1,540 words) [view diff] no match in snippet view article find links to article
mathematics, a well-posed problem is one for which the following properties hold: The problem has a solution The solution is unique The solution's behavior
Ugly Betty season 3 (1,719 words) [view diff] no match in snippet view article find links to article
Entertainment Weekly, he asked Ferrera about the absence of the two actors after they were no-shows at the Season 3 premiere party in New York City on
Tsume shogi (2,114 words) [view diff] no match in snippet view article find links to article
Classic Tsume Shogi Problem ☖ pieces in hand: 飛2角金4銀桂4歩17 ☗ pieces in hand: 銀 Composer is unknown. The solution is 1. +B-52 2. S41x52 3. S*42 or 1. +B-52
Cognitive impairment (1,723 words) [view diff] no match in snippet view article find links to article
judgement based on the diagnosis (the specific cognitive problem), the person's symptoms, other patient factors including expectations and the person's own
Igo Hatsuyōron (2,037 words) [view diff] no match in snippet view article find links to article
the first problem has no solution, and suggests that it could have been placed in first position by some rival school, to discredit the book. The copy
Formal proof (579 words) [view diff] no match in snippet view article find links to article
while the problem of finding proofs (automated theorem proving) is usually computationally intractable and/or only semi-decidable, depending upon the formal
Roger Shepard (3,016 words) [view diff] no match in snippet view article find links to article
convinced that the problem of generalization was the most fundamental problem confronting learning theory. Because we never encounter exactly the same total
Riemann–Hilbert problem (3,712 words) [view diff] no match in snippet view article find links to article
Riemann–Hilbert problems, named after Bernhard Riemann and David Hilbert, are a class of problems that arise in the study of differential equations in the complex
Kolmogorov complexity (7,825 words) [view diff] no match in snippet view article find links to article
argument, Gödel's incompleteness theorem, and Turing's halting problem. In particular, no program P computing a lower bound for each text's Kolmogorov complexity
Coin problem (3,743 words) [view diff] no match in snippet view article find links to article
In mathematics, the coin problem (also referred to as the Frobenius coin problem or Frobenius problem, after the mathematician Ferdinand Frobenius) is
Index (economics) (790 words) [view diff] no match in snippet view article
within categories, such as purchasing power parity for currencies. The index number problem is a challenge in economics where statistical indices struggle
Philosophical analysis (1,310 words) [view diff] no match in snippet view article find links to article
true if and only if the subject is in the extension of the predicate. The problem is that there is no present king of France, so the present king of France
1948 Palestinian expulsion and flight (17,297 words) [view diff] no match in snippet view article find links to article
refugees have no form of identification other than an UNRWA identification card. Following the emergence of the Palestinian refugee problem after the 1948 Arab–Israeli
Simplex algorithm (6,259 words) [view diff] no match in snippet view article find links to article
This continues until the maximum value is reached, or an unbounded edge is visited (concluding that the problem has no solution). The algorithm always terminates
Tower of Hanoi (7,124 words) [view diff] no match in snippet view article find links to article
The Tower of Hanoi (also called The problem of Benares Temple, Tower of Brahma or Lucas' Tower, and sometimes pluralized as Towers, or simply pyramid
Numberjacks (1,691 words) [view diff] no match in snippet view article find links to article
report problems that need solving. One or two of the Numberjacks fly out on location to investigate the issues, that are normally caused by the show's
Quantum annealing (3,406 words) [view diff] no match in snippet view article find links to article
mainly for problems where the search space is discrete (combinatorial optimization problems) with many local minima; such as finding the ground state
Initial value problem (1,377 words) [view diff] no match in snippet view article find links to article
an initial value problem (IVP) is an ordinary differential equation together with an initial condition which specifies the value of the unknown function
Graph partition (2,979 words) [view diff] no match in snippet view article find links to article
partition problem can be shown to be NP-complete to approximate within any finite factor. Even for special graph classes such as trees and grids, no reasonable
No Problem (Sonny Rollins album) (238 words) [view diff] no match in snippet view article
No Problem is an album by jazz saxophonist Sonny Rollins, recorded for the Milestone label in 1981, featuring performances by Rollins with Bobby Broom
New mysterianism (1,528 words) [view diff] no match in snippet view article find links to article
position proposing that the hard problem of consciousness cannot be resolved by humans. The unresolvable problem is how to explain the existence of qualia
Edge coloring (8,472 words) [view diff] no match in snippet view article find links to article
a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem asks whether
Political status of Crimea (8,191 words) [view diff] no match in snippet view article find links to article
The Crimean problem (Russian: Проблема Крыма, romanized: Problyema Kryma; Ukrainian: Кримська проблема, romanized: Krymska problema) or the Crimean question
M source (1,207 words) [view diff] no match in snippet view article find links to article
Pierson Parker. The Gospel Before Mark. Chicago: University of Chicago Press, 1953. Farmer, William R. (1981) [1964]. The Synoptic Problem: A Critical Analysis
Neurological examination (956 words) [view diff] no match in snippet view article find links to article
If a problem is found either in an investigative or screening process, then further tests can be carried out to focus on a particular aspect of the nervous
Quadratic programming (1,923 words) [view diff] no match in snippet view article find links to article
Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks
Complete (complexity) (304 words) [view diff] no match in snippet view article
computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity
Mutilated chessboard problem (2,878 words) [view diff] no match in snippet view article find links to article
The mutilated chessboard problem is a tiling puzzle posed by Max Black in 1946 that asks: Suppose a standard 8×8 chessboard (or checkerboard) has two diagonally