C. G. Bell, C. J. Mudge, and J. E. Mcnamara, Computer Engineering, A DEC view of hardware systems design, 1978.

A. Van-den and . Bogaard, Stijlen van programmeren 1952-1972, Studium, vol.2, pp.128-144, 2008.

N. G. De-bruijn, Verslag inzake onderzoek betreffende electronische en electrische rekenapparatuur over het cursusjaar 1947/48, 1948.

M. Campbell-kelly, Alan Turing's other universal machine, Communications of the ACM, vol.55, issue.7, pp.31-33, 2012.
DOI : 10.1145/2209249.2209277

A. Wesley and . Clark, The logical structure of digital computers, 1955.

A. Wesley and . Clark, The Lincoln TX-2 computer development, Proceedings WJCC, pp.43-145, 1957.

A. Wesley and . Clark, Oral history interview by, 1990.

H. B. Curry, The combinatory foundations of mathematical logic, The Journal of Symbolic Logic, vol.7, issue.02, pp.49-64, 1942.
DOI : 10.1090/S0002-9947-1941-0005275-6

H. B. Curry, A program composition technique as applied to inverse interpolation, 1950.

M. Davis, Engines of Logic: Mathematicians and the Origin of the, Computer. W.W. Norton and Company, 2001.

E. G. Daylight, Interview with Van der Poel in, 2010.

E. G. Daylight, Towards a historical notion of 'Turing ? the father of computer science'. History and Philosophy of Logic, pp.205-228, 2015.

P. Denning, D. E. Comer, and D. Gries, Computing as a discipline, Communications of the ACM, vol.32, issue.1, pp.9-23, 1989.
DOI : 10.1145/63238.63239

S. P. Frankel, Useful applications of a magnetic-drum computer, Electrical Engineering, vol.75, issue.7, pp.634-639, 1956.
DOI : 10.1109/EE.1956.6442018

S. P. Frankel, The Logical Design of a Simple General Purpose Computer, IEEE Transactions on Electronic Computers, vol.6, issue.1, pp.5-14, 1957.
DOI : 10.1109/TEC.1957.5221555

S. P. Frankel, On the Minimum Logical Complexity Required for a General Purpose Computer, IEEE Transactions on Electronic Computers, vol.7, issue.4, pp.282-285, 1958.
DOI : 10.1109/TEC.1958.5222660

H. Herman, J. Goldstine, and . Von-neumann, Planning and coding of problems for an electronic computing instrument part I,II and III, 1947-48

I. Grattan-guinness, The search for mathematical roots, 1870?1940 : logics , set theories and the foundations of mathematics from Cantor through Russell to Gödel, 2000.
DOI : 10.1515/9781400824045

T. Haigh, M. Priestley, and C. Rope, Reconsidering the Stored-Program Concept, IEEE Annals of the History of Computing, vol.36, issue.1, pp.1-4, 2014.
DOI : 10.1109/MAHC.2013.56

H. Hermes, Die Universalität programmgesteuerter Rechenmaschinen, Math.-Phys. Semsterberichte (Göttingen), vol.4, pp.42-53, 1954.

A. Hodges, M. Alan, and . Turing, The enigma, Republication, 1983.

H. D. Huskey, From ACE to the G-15, IEEE Annals of the History of Computing, vol.6, issue.4, pp.350-371, 1984.
DOI : 10.1109/MAHC.1984.10047

S. C. Kleene, Representation of events in nerve nets and finite automata Partially reprinted as: Representation of events in nerve nets and finite automata, Automata Studies, pp.3-42, 1951.

E. Kranakis, Early Computers in The Netherlands, CWI-Quarterly, vol.1, issue.4, pp.61-84, 1988.

W. Mcculloch, W. , W. Pitts, and W. , A logical calculus of the ideas immanent in nervous activity, Bulletin of Mathematical Biophysics, vol.5, p.115133, 1943.

S. Michael and . Mahoney, The histories of computing(s), Interdisciplinary Science Reviews, vol.30, issue.2, pp.119-132

S. Michael and . Mahoney, Histories of Computing, 2011.

M. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961.
DOI : 10.2307/1970290

J. L. Mitchell and K. H. Olsen, TX-0: A Transistor Computer, AFIPS Conferece Proceedings EJCC 10, pp.93-101, 1956.

M. Liesbeth-de-mol, M. Carlé, and . Bullynck, Haskell before Haskell: an alternative lesson in practical logics of the ENIAC, Journal of Logic and Computation, vol.25, issue.4, pp.1011-1046, 2014.
DOI : 10.1093/logcom/exs072

E. F. Moore, A simplified universal Turing machine, Proceedings of the 1952 ACM national meeting (Toronto) on , ACM '52, pp.50-54, 1952.
DOI : 10.1145/800259.808993

E. F. Moore and C. E. Shannon, Electrical circuit analyzer. US Patent 2,776,405, 1953.

R. Mapstone, Interview with Max Palevsky, 1973.

W. Van, Inzending 1946/47 van Van der Poel op de prijsvraag genaamd " 1+1=10, 1948.

L. Willem and . Van, A simple electronic digital computer, Applied Scientific Research Section B, vol.2, pp.367-400, 1952.

W. L. Van, The Logical Principles of Some Simple Computers, 1956.

W. L. Van, Digitale Informationswandler, chapter Microprogramming and trickology, pp.269-311, 1961.

W. L. Van, Een leven met computers, TU Delft, 1988.

E. L. Post, Finite combinatory processes???formulation, The Journal of Symbolic Logic, vol.1, issue.03, pp.103-105, 1936.
DOI : 10.2307/2371045

E. L. Post, Absolutely unsolvable problems and relatively undecidable propositions-Account of an anticipation The undecidable . Basic papers on undecidable propositions, unsolvable problems and computable functions, p.340433, 1965.

W. V. Quine, The Problem of Simplifying Truth Functions, The American Mathematical Monthly, vol.59, issue.8, pp.521-531, 1952.
DOI : 10.2307/2308219

M. Schönfinkel, ???ber die Bausteine der mathematischen Logik, Mathematische Annalen, vol.92, issue.3-4, pp.305-316, 1879.
DOI : 10.1007/BF01448013

C. E. Shannon, A symbolic analysis of relay and switching circuits, Transactions of the American Institute of Electrical Engineers, vol.57, 1938.

C. E. Shannon, The Synthesis of Two-Terminal Switching Circuits, Bell System Technical Journal, vol.28, issue.1, pp.59-98, 1940.
DOI : 10.1002/j.1538-7305.1949.tb03624.x

C. E. Shannon, A Universal Turing Machine with Two Internal States, Automata Studies, pp.157-166, 1956.
DOI : 10.1515/9781400882618-007

H. M. Sheffer, A set of five independent postulates for Boolean algebras, with application to logical constants, Transactions of the American Mathematical Society, vol.14, issue.4, pp.481-488, 1913.
DOI : 10.1090/S0002-9947-1913-1500960-1

C. John, H. E. Shepherdson, and . Sturgis, Computability of Recursive Functions, Journal of the ACM, vol.10, pp.217-255, 1963.

R. Sprague, A western view of computer history, Communications of the ACM, vol.15, issue.7, pp.686-692, 1972.
DOI : 10.1145/361454.361518

M. Tedre, The Science of Computing. Shaping of a Discipline, Boca Rato: CRC, 2015.

A. M. Turing, On computable numbers with an application to the Entscheidungsproblem A correction to the paper was published in the same journal, Proceedings of the London Mathematical Society, pp.230-265, 1936.

A. M. Turing, Lecture to the London Mathematical Society on 20 february 1947, A.M. Turing's ACE Report of 1946 and Other papers, pp.106-124, 1947.

C. J. Verhagen, Rekenmachines in Delft, 1960.

H. Wang, A Variant to Turing's Theory of Computing Machines, Journal of the ACM, vol.4, issue.1, pp.63-92, 1957.
DOI : 10.1145/320856.320867

M. V. Wilkes and J. B. Stringer, Microprogramming and the Design of the Control Circuits in an Electronic Digital Computer, Proceedings of the Cambridge Philosophical Society, v. 49, pp.230-238, 1953.

D. Woods and T. Neary, The complexity of small universal Turing machines: A survey, Theoretical Computer Science, vol.410, issue.4-5, pp.443-450, 2009.
DOI : 10.1016/j.tcs.2008.09.051