From Ramon Llull To Lov Grover: Towards A Universal Logic Machine

Abstract

This paper illustrates that Ramon Llull’s Logic Machine is a precursor of contemporary computer applications and systems. Logic Machines search the space of all potential solutions and select those that satisfy all constraints. Examples describe SAT solvers, MAX-SAT, and the famous quantum algorithm of Lov Grover satisfiability which forms the basis of Logic Machines as devices composed of a generator and a verifier.