Church–Turing thesis
When a programming language is able to do what a Turing machine can do, that language is called Turing complete. If a problem is solvable in one such language, then it is solvable in all of those.