No More Learning

Otherwise Alan Turing could never have de- vised his famous mathematical machine, which, on the one hand, disproved Hilbert's Entscheidungsproblem but, on the other hand, proved that a small,           practically speaking powerful subset of the real numbers is nev- ertheless computable.