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

Authors

George Opsahl, Portland State University
Marek A. Perkowski, Portland State UniversityFollow

Published In

2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)

Document Type

Citation

Publication Date

6-22-2023

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.

Rights

©2023 IEEE

Locate the Document

https://doi.org/10.1109/ISMVL57333.2023.00042

DOI

10.1109/ISMVL57333.2023.00042

Persistent Identifier

https://archives.pdx.edu/ds/psu/40438

Publisher

IEEE

Citation Details

Opsahl, G., & Perkowski, M. (2023, May). From Ramon Llull To Lov Grover: Towards A Universal Logic Machine. In 2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL) (pp. 176-183). IEEE.