TY - JOUR T1 - Setting-up early computer programs: D. H. Lehmer's ENIAC computation JF - Archive for Mathematical Logic Y1 - 2010 A1 - Bullynck, Maarten A1 - De Mol, Liesbeth ED - Beckmann, Arnold ED - Dimitracopoulos, Costas ED - Löwe, Benedikt AB -

A complete reconstruction of Lehmer's ENIAC set-up for computing the exponents of p modulo two is given. This program served as an early test program for the ENIAC (1946). The reconstruction illustrates the difficulties of early programmers to find a way between a man operated and a machine operated computation. These difficulties concern both the content level (the algorithm) and the formal level (the logic of sequencing operations).

VL - 49 SP - 123–146 UR - http://dx.doi.org/10.1007/s00153-009-0169-8 ER - TY - CONF T1 - A week-end off: the first extensive number-theoretical computation on the ENIAC T2 - Logic and Theory of Algorithms Y1 - 2008 A1 - De Mol, Liesbeth A1 - Bullynck, Maarten ED - Beckmann, Arnold ED - Dimitracopoulos, Costas ED - Löwe, Benedikt AB -

The first extensive number-theoretical computation run on the ENIAC, is reconstructed. The problem, computing the exponent of 2 modulo a prime, was set up on the ENIAC during a week-end in July 1946 by the number-theorist D.H. Lehmer, with help from his wife Emma and John Mauchly. Important aspects of the ENIAC's design are presented-and the reconstruction of the implementation of the problem on the ENIAC is discussed in its salient points.

JA - Logic and Theory of Algorithms PB - Springer Verlag SN - 978-3-540-69405-2 ER -