Liesbeth De Mol

Orcid: 0000-0001-8520-2493

According to our database1, Liesbeth De Mol authored at least 22 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Myth of the Coder.
Commun. ACM, September, 2024

2023
Obituary of Martin Davis (1928-2023).
IEEE Ann. Hist. Comput., 2023

2022
Characterizing the Nature of Programs for educational purposes.
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.
Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, 2022

2021
Roots of 'program' revisited.
Commun. ACM, 2021

Russian Logics and the Culture of Impossible: Part II - Reinterpreting Algorithmic Rationality.
IEEE Ann. Hist. Comput., 2021

Russian Logics and the Culture of Impossible: Part I - Recovering Intelligentsia Logics.
IEEE Ann. Hist. Comput., 2021

Logic, Programming, and Computer Science: Local Perspectives.
IEEE Ann. Hist. Comput., 2021

2018
Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950s.
IEEE Ann. Hist. Comput., 2018

2015
Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.
J. Log. Comput., 2015

Why did computer science make a hero out of Turing?
Commun. ACM, 2015

2014
The Proof Is in the Process: A Preamble for a Philosophy of Computer-Assisted Mathematics.
Proceedings of the New Directions in the Philosophy of Science, 2014

2011
On the complex behavior of simple tag systems - An experimental approach.
Theor. Comput. Sci., 2011

2010
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems.
Fundam. Informaticae, 2010

Setting-up early computer programs: D. H. Lehmer's ENIAC computation.
Arch. Math. Log., 2010

Haskell before Haskell: Curry's Contribution to Programming (1946-1950).
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008
Tag systems and Collatz-like functions.
Theor. Comput. Sci., 2008

On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results
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.
Proceedings of the Bringing together Philosophy and Sociology of Science, 2008

A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Study of Limits of Solvability in Tag Systems.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006
Closing the Circle: An Analysis of Emil Post's Early Work.
Bull. Symb. Log., 2006


  Loading...