A week-end off: The first extensive number-theoretical computation on the ENIAC

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

De Mol, L., & Bullynck, M. (2008). A week-end off: The first extensive number-theoretical computation on the ENIAC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 158–167). https://doi.org/10.1007/978-3-540-69407-6_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free