Search results
Results From The WOW.Com Content Network
This article is a list of notable 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 about proposed solutions.
List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine [ edit ]
In the field of theoretical computer science the computability and complexity of computational problems are often sought-after. Computability theory describes the degree to which problems are computable, whereas complexity theory describes the asymptotic degree of resource consumption.
Project Euler (named after Leonhard Euler) is a website dedicated to a series of computational problems intended to be solved with computer programs. [1] [2] The project attracts graduates and students interested in mathematics and computer programming.
Pages in category "Unsolved problems in computer science" The following 33 pages are in this category, out of 33 total. This list may not reflect recent changes .
Whether these problems are not decidable in polynomial time is one of the greatest open questions in computer science (see P versus NP ("P = NP") problem for an in-depth discussion). An important notion in this context is the set of NP-complete decision problems, which is a subset of NP and might be informally described as the "hardest ...
In number theory and computer science, the partition problem, or number partitioning, [1] is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S 1 and S 2 such that the sum of the numbers in S 1 equals the sum of the numbers in S 2.
A decision problem whose input consists of strings or more complex values is formalized as the set of numbers that, via a specific Gödel numbering, correspond to inputs that satisfy the decision problem's criteria. A decision problem A is called decidable or effectively solvable if the formalized set of A is a recursive set.