Ads
related to: hardest subjects in computer science world
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.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Help; Learn to edit; Community portal; Recent changes; Upload file
Goldbach’s Conjecture. One of the greatest unsolved mysteries in math is also very easy to write. Goldbach’s Conjecture is, “Every even number (greater than two) is the sum of two primes ...
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.
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem is a task solved by a computer.