the “undecidability theorem” proved by the British logician Alan Turing back in the 1930s. Paraphrased, the theorem essentially says that no matter how smart you think you are, there will always be algorithms that do things you can’t predict in advance. The only way to find out what they will do is to run them.
