Search results
Results from the WOW.Com Content Network
Many, if not most, undecidable problems in mathematics can be posed as word problems: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not. For undecidability in axiomatic mathematics, see List of statements undecidable in ZFC.
This is a list of puzzles that cannot be solved. An impossible puzzle is a puzzle that cannot be resolved, either due to lack of sufficient information, or any number of logical impossibilities. 15 Puzzle – Slide fifteen numbered tiles into numerical order. It is impossible to solve in half of the starting positions. [1]
Another definition is "a problem whose social complexity means that it has no determinable stopping point". [2] Moreover, because of complex interdependencies, the effort to solve one aspect of a wicked problem may reveal or create other problems. Due to their complexity, wicked problems are often characterized by organized irresponsibility.
For example, if s=2, then 𝜁(s) is the well-known series 1 + 1/4 + 1/9 + 1/16 + …, which strangely adds up to exactly 𝜋²/6. When s is a complex number—one that looks like a+b𝑖, using ...
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
Hedgehog's dilemma: Despite goodwill, human intimacy cannot occur without substantial mutual harm. Inventor's paradox: It is easier to solve a more general problem that covers the specifics of the sought-after solution. Kavka's toxin puzzle: Can one intend to drink the non-deadly toxin, if the intention is the only thing needed to get the reward?
Can 3SUM be solved in strongly sub-quadratic time, that is, in time O(n 2−ϵ) for some ϵ>0? Can the edit distance between two strings of length n be computed in strongly sub-quadratic time? (This is only possible if the strong exponential time hypothesis is false.) Can X + Y sorting be done in o(n 2 log n) time?
The Prince of Wales said the future of humanity depends on ‘an ever more urgent solution’.