21 citations · 27 across the 4 of their papers we have counts for
4 papers
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop +1
Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?
A Swiss Pocket Knife for Computability
Neil D. Jones
This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and cons…
Fifty Years of the Spectrum Problem: Survey and New Results
Arnaud Durand, Neil Jones, Johann Makowsky +1
In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of…
Call-by-value Termination in the Untyped lambda-calculus
Neil D. Jones, Nina Bohr
A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value). The ``size-change principle'' f…