Ghent University Academic Bibliography

Advanced

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

Liesbeth De Mol UGent and Maarten Bullynck (2008) LECTURE NOTES IN COMPUTER SCIENCE. 5028. p.158-167
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.
Please use this url to cite or link to this publication:
author
organization
year
type
conference
publication status
published
subject
keyword
Derrick H. Lehmer, ENIAC, number theory, Fermat's little theorem, early programming, parallelism, prime sieve, ELECTRONIC-COMPUTER, LIFE
in
LECTURE NOTES IN COMPUTER SCIENCE
Lect. Notes Comput. Sci.
editor
Arnold Beckmann, Costas Dimitracopoulos and Benedikt Loewe
volume
5028
issue title
LOGIC AND THEORY OF ALGORITHMS
pages
158 - 167
publisher
Springer Verlag
place of publication
Berlin, Germany
conference name
4th Conference on Computability in Europe (CiE 2008)
conference location
Athens, Greece
conference start
2008-06-15
conference end
2008-06-20
Web of Science type
Proceedings Paper
Web of Science id
000256879500019
ISSN
0302-9743
ISBN
978-3-540-69405-2
language
English
UGent publication?
yes
classification
P1
copyright statement
I have retained and own the full copyright for this publication
id
430672
handle
http://hdl.handle.net/1854/LU-430672
date created
2008-10-09 10:11:00
date last changed
2009-06-04 16:30:26
@inproceedings{430672,
  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.},
  author       = {De Mol, Liesbeth and Bullynck, Maarten},
  booktitle    = {LECTURE NOTES IN COMPUTER SCIENCE},
  editor       = {Beckmann, Arnold and Dimitracopoulos, Costas and Loewe, Benedikt},
  isbn         = {978-3-540-69405-2},
  issn         = {0302-9743},
  keyword      = {Derrick H. Lehmer,ENIAC,number theory,Fermat's little theorem,early programming,parallelism,prime sieve,ELECTRONIC-COMPUTER,LIFE},
  language     = {eng},
  location     = {Athens, Greece},
  pages        = {158--167},
  publisher    = {Springer Verlag},
  title        = {A week-end off: the first extensive number-theoretical computation on the ENIAC},
  volume       = {5028},
  year         = {2008},
}

Chicago
De Mol, Liesbeth, and Maarten Bullynck. 2008. “A Week-end Off: The First Extensive Number-theoretical Computation on the ENIAC.” In Lecture Notes in Computer Science, ed. Arnold Beckmann, Costas Dimitracopoulos, and Benedikt Loewe, 5028:158–167. Berlin, Germany: Springer Verlag.
APA
De Mol, L., & Bullynck, M. (2008). A week-end off: the first extensive number-theoretical computation on the ENIAC. In A. Beckmann, C. Dimitracopoulos, & B. Loewe (Eds.), LECTURE NOTES IN COMPUTER SCIENCE (Vol. 5028, pp. 158–167). Presented at the 4th Conference on Computability in Europe (CiE 2008), Berlin, Germany: Springer Verlag.
Vancouver
1.
De Mol L, Bullynck M. A week-end off: the first extensive number-theoretical computation on the ENIAC. In: Beckmann A, Dimitracopoulos C, Loewe B, editors. LECTURE NOTES IN COMPUTER SCIENCE. Berlin, Germany: Springer Verlag; 2008. p. 158–67.
MLA
De Mol, Liesbeth, and Maarten Bullynck. “A Week-end Off: The First Extensive Number-theoretical Computation on the ENIAC.” Lecture Notes in Computer Science. Ed. Arnold Beckmann, Costas Dimitracopoulos, & Benedikt Loewe. Vol. 5028. Berlin, Germany: Springer Verlag, 2008. 158–167. Print.