It is mathematically impossible to calculate everything

There exist well-defined functions for which no computer procedure can reach a result. The most famous case is the halting problem, which demonstrates the impossibility of designing a universal Turing machine capable of guessing whether another program will stop or run indefinitely. All computing models being equivalent, this limit applies universally to all current computers.