Liesbeth De Mol - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2023

Obituary of Martin Davis (1928-2023)Alberto Policriti, Eugenio G. Omodeo, Liesbeth De Mol. annals, 45(1):93-94, January - March 2023. [doi]

2022

2021

2018

Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950sLiesbeth De Mol, Maarten Bullynck, Edgar G. Daylight. annals, 40(1):19-45, 2018. [doi]

2015

Why did computer science make a hero out of Turing?Maarten Bullynck, Edgar G. Daylight, Liesbeth De Mol. CACM, 58(3):37-39, 2015. [doi]

Haskell before Haskell: an alternative lesson in practical logics of the ENIACLiesbeth De Mol, Martin Carlé, Maarten Bullynck. logcom, 25(4):1011-1046, 2015. [doi]

2014

The Proof Is in the Process: A Preamble for a Philosophy of Computer-Assisted MathematicsLiesbeth De Mol. In Maria Carla Galavotti, Dennis Dieks, Wenceslao J. Gonzalez, Stephan Hartmann, Thomas Uebel, Marcel Weber, editors, New Directions in the Philosophy of Science. pages 15-33, Springer, 2014. [doi]

2011

On the complex behavior of simple tag systems - An experimental approachLiesbeth De Mol. TCS, 412(1-2):97-112, 2011. [doi]

2010

Setting-up early computer programs: D. H. Lehmer s ENIAC computationMaarten Bullynck, Liesbeth De Mol. AML, 49(2):123-146, 2010. [doi]

Haskell before Haskell: Curry s Contribution to Programming (1946-1950)Liesbeth De Mol, Maarten Bullynck, Martin Carlé. CiE 2010: 108-117 [doi]

Solvability of the Halting and Reachability Problem for Binary 2-tag SystemsLiesbeth De Mol. FUIN, 99(4):435-471, 2010. [doi]

2008

Tag systems and Collatz-like functionsLiesbeth De Mol. TCS, 390(1):92-101, 2008. [doi]

On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental ResultsLiesbeth De Mol. icsp 2008: 63-76

A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIACLiesbeth De Mol, Maarten Bullynck. cie 2008: 158-167 [doi]

Looking for busy beavers. A socio-philosophical study of a computer-assisted proofLiesbeth De Mol. fotfs 2011: 61-90

2007

Study of Limits of Solvability in Tag SystemsLiesbeth De Mol. mcu 2007: 170-181 [doi]

2006

Closing the Circle: An Analysis of Emil Post s Early WorkLiesbeth De Mol. bsl, 12(2):267-289, 2006. [doi]

Sign in or sign up to see more results.

runs on WebDSL