{"title":"从雷蒙·鲁到洛夫·格罗弗:走向通用逻辑机","authors":"George Opsahl, M. Perkowski","doi":"10.1109/ISMVL57333.2023.00042","DOIUrl":null,"url":null,"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.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"From Ramon Llull To Lov Grover: Towards A Universal Logic Machine\",\"authors\":\"George Opsahl, M. Perkowski\",\"doi\":\"10.1109/ISMVL57333.2023.00042\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":419220,\"journal\":{\"name\":\"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL57333.2023.00042\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL57333.2023.00042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
From Ramon Llull To Lov Grover: Towards A Universal Logic Machine
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
