[Church:] Review of "A. M. Turing. On Computable numbers, with an application to the Entscheidungsproblem" (+) [Turing:] Computability and lambda-definability (+) The Ø-Function in lambda-K-Conversion. [In Volume 2, number 1-4, 1937 of "Journal of Sym... - [COINING THE PHRASE "TURING MACHINE"] by CHURCH, ALONZO (+) ALAN TURING - 1937

1937. Wisconsin, The Association for Symbolic Logic, 1937. Lev8vo. Entire volume 2 offered. Bound in half cloth with marbled boards. Gilt title to spine. Library stamp pasted on to lower part of spine and top left corner of front board. Two stamps (in Chinese) to verso of title-page and final page of index. A fine and clean copy. [Church:] Pp. 42-3; 101-2. [Turing:] Pp. 153-163; 164. [Entire volume: iv, 188 pp.]. First publication of Church's famous review of Alan Turing's "On computable numbers" in which Church coined the phrase "Turing Machine". With regard to Turing's proof of the insolvability of Hilbert's 'Entscheidungsproblem', Church acknowledged that "computability by a Turing machine ... has the advantage of making the identification with effectiveness in the ordinary (not explicitly defined) sense evident immediately - i.e. without the necessity of proving preliminary theorems". (Hook & Norman: Origins of Cyberspace, 251).The volume also contains Turing's influential "Computability and lambda-definability" in which he proved that computable functions "are identical with the lambda-definable functions of Church and the general recursive functions due to Herbrand and Gödel and developed by Kleene". (Hook & Norman: Origins of Cyberspace, 395).The volume contains the following papers by W. V. Quine:1. On derivability. Pp. 113-19.2. On Cantor's theorem. Pp. 120-24.3. Logic based on inclusion and abstraction. Pp. 145-152.