decidability of the first-order theory of the real numbers Alfred Tarski implement numbers pure mathematics was proved real numbers or prove computational complexity
An example of the second case is the decidability of the first-order theory of the real numbers, a problem of pure mathematics that was proved true by Alfred Tarski, with an algorithm that is impossible to implement because of a computational complexity that is much too high.