@article {de2012short, title = {A short history of small machines}, year = {2012}, abstract = {

One of the most famous results of Alan M. Turing is the so-called universal Tur- ing machine (UTM). Its in uence on (theoretical) computer science can hardly be overestimated. The operations of this machine are of a most elementary na- ture but nonetheless considered to capture all the (human) processes that can be carried out in computing a number. This kind of elementary machine ts into a tradition of {\textquoteleft}logical minimalism{\textquoteright} that looks for simplest sets of operations or axioms. It is part of the more general research programme into the foundations of mathematics and logic that was carried out in the beginning of the 20th cen- tury. In the 1940s and 1950s, however, this tradition was rede ned in the context of {\textquoteleft}computer science{\textquoteright} when computer engineers, logicians and mathematicians re-considered the problem of small(est) and/or simple(st) machines in the con- text of actual engineering practices. This paper looks into this early history of research on small symbolic and physical machines and tie it to this older tradi- tion of logical minimalism. Focus will be on how the transition and translation of symbolic machines into real computers integrates minimalist philosophies as parts of more complex computer design strategies. This contextualizes Turing{\textquoteright}s machines at the turn from logic to machines.

}, author = {De Mol, Liesbeth and Bullynck, Maarten} } @article {934535, title = {Setting-up early computer programs: D. H. {L}ehmer{\textquoteright}s ENIAC computation}, journal = {Archive for Mathematical Logic}, volume = {49}, number = {2}, year = {2010}, pages = {123{\textendash}146}, abstract = {

A complete reconstruction of Lehmer{\textquoteright}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).

}, issn = {1432-0665}, url = {http://dx.doi.org/10.1007/s00153-009-0169-8}, author = {Bullynck, Maarten and De Mol, Liesbeth}, editor = {Beckmann, Arnold and Dimitracopoulos, Costas and L{\"o}we, Benedikt} }