Original: In computational complexity theory, the Cook - Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete.
Simplified: The question of whether such an algorithm exists is called the P versus NP problem and it is widely considered the most important unsolved problem in theoretical computer science.