<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Heeffer, Albrecht</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">François, Karen</style></author><author><style face="normal" font="default" size="100%">Löwe, Benedikt</style></author><author><style face="normal" font="default" size="100%">Müller, Thomas</style></author><author><style face="normal" font="default" size="100%">Van Kerkhove, Bart</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On the curious historical coincidence of algebra and double-entry bookkeeping</style></title><secondary-title><style face="normal" font="default" size="100%">Foundations of the formal sciences VII : bringing together philosophy and sociology of science</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Studies in Logic</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.collegepublications.co.uk/logic/?00021</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><volume><style face="normal" font="default" size="100%">32</style></volume><pages><style face="normal" font="default" size="100%">109–130</style></pages><isbn><style face="normal" font="default" size="100%">9781848900493</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">François, Karen</style></author><author><style face="normal" font="default" size="100%">Löwe, Benedikt</style></author><author><style face="normal" font="default" size="100%">Müller, Thomas</style></author><author><style face="normal" font="default" size="100%">Van Kerkhove, Bart</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Looking for busy beavers. A socio-philosophical study of a computer-assisted proof</style></title><secondary-title><style face="normal" font="default" size="100%">Foundations of the Formal Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pages><style face="normal" font="default" size="100%">61–90</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;em&gt;&quot;Young man, in mathematics you don't understand things, you just get used to them&quot;&lt;/em&gt; John von Neumann&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bullynck, Maarten</style></author><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Beckmann, Arnold</style></author><author><style face="normal" font="default" size="100%">Dimitracopoulos, Costas</style></author><author><style face="normal" font="default" size="100%">Löwe, Benedikt</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Setting-up early computer programs: D. H. Lehmer's ENIAC computation</style></title><secondary-title><style face="normal" font="default" size="100%">Archive for Mathematical Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s00153-009-0169-8</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">49</style></volume><pages><style face="normal" font="default" size="100%">123–146</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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).&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author><author><style face="normal" font="default" size="100%">Bullynck, Maarten</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Beckmann, Arnold</style></author><author><style face="normal" font="default" size="100%">Dimitracopoulos, Costas</style></author><author><style face="normal" font="default" size="100%">Löwe, Benedikt</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A week-end off: the first extensive number-theoretical computation on the ENIAC</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Theory of Algorithms</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><isbn><style face="normal" font="default" size="100%">978-3-540-69405-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record></records></xml>