Setting-up early computer programs: D. H. Lehmer’s ENIAC computation

&
Archive for Mathematical Logic 49 (2):123-146 (2010)
  Copy   BIBTEX

Abstract

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

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-009-0169-8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Setting-up early computer programs: D. H. Lehmer’s ENIAC computation. [REVIEW]Maarten Bullynck & Liesbeth De Mol - 2010 - Archive for Mathematical Logic 49 (2):123-146.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
Provability in predicate product logic.Michael C. Laskowski & Shirin Malekpour - 2007 - Archive for Mathematical Logic 46 (5-6):365-378.
Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
Ramsey’s theorem and König’s Lemma.T. E. Forster & J. K. Truss - 2007 - Archive for Mathematical Logic 46 (1):37-42.
An ordinal analysis of parameter free Π12-comprehension.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (3):263-362.
Resplendent models and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_1^1}$$\end{document} -definability with an oracle. [REVIEW]Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
Free Łukasiewicz implication algebras.José Díaz Varela - 2008 - Archive for Mathematical Logic 47 (1):25-33.
The problem of the formalization of constructive topology.Silvio Valentini - 2005 - Archive for Mathematical Logic 44 (1):115-129.
Definability of second order generalized quantifiers.Juha Kontinen - 2010 - Archive for Mathematical Logic 49 (3):379-398.
Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.

Analytics

Added to PP
2017-02-22

Downloads
7 (#1,389,841)

6 months
6 (#526,006)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

„A pretence of what is not“? Eine Untersuchung von Simulation(en) aus der ENIAC-Perspektive.Liesbeth De Mol - 2019 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 27 (4):443-478.
‘A Pretence of What is Not’? A Study of Simulation(s) from the ENIAC Perspective.Liesbeth De Mol - 2019 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 27 (4):443-478.

Add more citations

References found in this work

No references found.

Add more references