Solvable and Unsolvable Problems [in] Science News 31

Turing proves the existence of mathematical problems that cannot be solved by the universal Turing machine, now called the Church–Turing thesis. The proof shows that there are mathematical problems which cannot be solved by any systematic method—cannot, in other words, be solved by any algorithm. First edition, slightly age-toned. 6½" - 8½".