Switch to: References

Add citations

You must login to add citations.
  1. Martin Davis on Computability, Computational Logic, and Mathematical Foundations.Alberto Policriti & Eugenio Omodeo (eds.) - 2016 - Cham, Switzerland: Springer Verlag.
    This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis’ work and set it in a contemporary context. They analyse, discuss and develop many of the ideas and concepts that Davis put forward, including such issues as contemporary satisfiability solvers, essential unification, quantum computing and generalisations of Hilbert’s tenth problem. (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
    A new proof is given of the celebrated theorem of M. Davis, H. Putnam and J. Robinson concerning exponential Diophantine representation of recursively enumerable predicates. The proof goes by induction on the defining scheme of a partial recursive function.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark