Liesbeth De Mol

According to our database, Liesbeth De Mol authored at least 21 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Obituary of Martin Davis (1928-2023).

Alberto Policriti, Eugenio G. Omodeo, Liesbeth De Mol

IEEE Ann. Hist. Comput., 2023

2022

Characterizing the Nature of Programs for educational purposes.

Violetta Lonati, Andrej Brodnik, Tim Bell, Andrew Paul Csizmadia, Liesbeth De Mol, Henry Hickman, Therese Keane, Claudio Mirolo, Mattia Monga, Matti Tedre

Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

What We Talk About When We Talk About Programs.

Violetta Lonati, Andrej Brodnik, Tim Bell, Andrew Paul Csizmadia, Liesbeth De Mol, Henry Hickman, Therese Keane, Claudio Mirolo, Mattia Monga

Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, 2022

2021

Roots of 'program' revisited.

Liesbeth De Mol, Maarten Bullynck

Commun. ACM, 2021

Russian Logics and the Culture of Impossible: Part II - Reinterpreting Algorithmic Rationality.

Ksenia Tatarchenko, Anya Yermakova, Liesbeth De Mol

IEEE Ann. Hist. Comput., 2021

Russian Logics and the Culture of Impossible: Part I - Recovering Intelligentsia Logics.

Ksenia Tatarchenko, Anya Yermakova, Liesbeth De Mol

IEEE Ann. Hist. Comput., 2021

Logic, Programming, and Computer Science: Local Perspectives.

Liesbeth De Mol

IEEE Ann. Hist. Comput., 2021

2018

Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950s.

Liesbeth De Mol, Maarten Bullynck, Edgar G. Daylight

IEEE Ann. Hist. Comput., 2018

2015

Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.

Liesbeth De Mol, Martin Carlé, Maarten Bullynck

J. Log. Comput., 2015

Why did computer science make a hero out of Turing?

Maarten Bullynck, Edgar G. Daylight, Liesbeth De Mol

Commun. ACM, 2015

2014

The Proof Is in the Process: A Preamble for a Philosophy of Computer-Assisted Mathematics.

Liesbeth De Mol

Proceedings of the New Directions in the Philosophy of Science, 2014

2011

On the complex behavior of simple tag systems - An experimental approach.

Liesbeth De Mol

Theor. Comput. Sci., 2011

2010

Solvability of the Halting and Reachability Problem for Binary 2-tag Systems.

Liesbeth De Mol

Fundam. Informaticae, 2010

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

Maarten Bullynck, Liesbeth De Mol

Arch. Math. Log., 2010

Haskell before Haskell: Curry's Contribution to Programming (1946-1950).

Liesbeth De Mol, Maarten Bullynck, Martin Carlé

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008

Tag systems and Collatz-like functions.

Liesbeth De Mol

Theor. Comput. Sci., 2008

On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results

Liesbeth De Mol

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Looking for busy beavers. A socio-philosophical study of a computer-assisted proof.

Liesbeth De Mol

Proceedings of the Bringing together Philosophy and Sociology of Science, 2008

A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC.

Liesbeth De Mol, Maarten Bullynck

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Study of Limits of Solvability in Tag Systems.

Liesbeth De Mol

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006

Closing the Circle: An Analysis of Emil Post's Early Work.

Liesbeth De Mol

Bull. Symb. Log., 2006