that cannot be solved
1Solved game — A two player game can be solved on several levels: [V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of ComputerScience, University of Limburg, 1994. Online:… …
2List of problems solved by MacGyver — This is a list of problems that have been solved by the fictional character MacGyver from the television series of the same name. (This list is not yet comprehensive.) MacGyver employs his resourcefulness and his knowledge of chemistry,… …
3Just Like That (novel) — infobox Book | name = Just Like That title orig = translator = image caption = author = Lily Brett cover artist = country = United States language = English series = genre = Autobiographical novel publisher = Macmillan (Australia) Andre Deutsch… …
4V-Cube 6 — The V Cube 6 is the 6×6×6 version of Rubik s Cube. Unlike the original puzzle (but like the 4×4×4 cube), it has no fixed facets: the center facets (16 per face) are free to move to different positions. It was invented by Panagiotis Verdes and is… …
5Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… …
6Rubik's Revenge — in solved state The Rubik s Revenge (also known as the Master Cube) is the 4×4×4 version of Rubik s Cube. Invented by Péter Sebestény, the Rubik s Revenge was nearly called the Sebestény Cube until a somewhat last minute decision changed the… …
7Group theory — is a mathematical discipline, the part of abstract algebra that studies the algebraic structures known as groups. The development of group theory sprang from three main sources: number theory, theory of algebraic equations, and geometry. The… …
8numerical analysis — the branch of mathematics dealing with methods for obtaining approximate numerical solutions of mathematical problems. [1925 30] * * * Branch of applied mathematics that studies methods for solving complicated equations using arithmetic… …
9Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …
10Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list …
