%0 Journal Article %J Archive for Mathematical Logic %D 2010 %T Setting-up early computer programs: D. H. Lehmer's ENIAC computation %A Bullynck, Maarten %A De Mol, Liesbeth %E Beckmann, Arnold %E Dimitracopoulos, Costas %E Löwe, Benedikt %X

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).

%B Archive for Mathematical Logic %V 49 %P 123–146 %G eng %U http://dx.doi.org/10.1007/s00153-009-0169-8 %0 Conference Paper %B Logic and Theory of Algorithms %D 2008 %T A week-end off: the first extensive number-theoretical computation on the ENIAC %A De Mol, Liesbeth %A Bullynck, Maarten %E Beckmann, Arnold %E Dimitracopoulos, Costas %E Löwe, Benedikt %X

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.

%B Logic and Theory of Algorithms %I Springer Verlag %@ 978-3-540-69405-2 %G eng %R 10.1007/978-3-540-69407-6_19