A Real World Mechanism for Testing Satisfiability in Polynomial Time
Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the blueprint for a machine which is able to test any formula in...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Schuh, Bernd R |
| description | Whether the satisfiability of any formula F of propositional calculus can be
determined in polynomial time is an open question. I propose a simple procedure
based on some real world mechanisms to tackle this problem. The main result is
the blueprint for a machine which is able to test any formula in conjunctive
normal form (CNF) for satisfiability in linear time. The device uses light and
some electrochemical properties to function. It adapts itself to the scope of
the problem without growing exponentially in mass with the size of the formula.
It requires infinite precision in its components instead. |
| doi_str_mv | 10.48550/arxiv.1001.3263 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1001_3263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1001_3263</sourcerecordid><originalsourceid>FETCH-LOGICAL-a653-6214b895af74e5527e0559f107f03b4fc5bd854da1865666e110eeeaf9b52ca83</originalsourceid><addsrcrecordid>eNotz01LxDAUheFsXMjo3pXkD7QmTW-aLofxE2ZQtOCy3LQ3eiFtJS1i_72Oujqr98AjxIVWeekA1BWmL_7MtVI6N4U1p-J6K58Jo3ydUuzlgbp3HHkeZJiSbGheeHyTL7jwHBg9R15WyaN8muI6TgP_hA0PdCZOAsaZzv93I5rbm2Z3n-0f7x52232GFkxmC116VwOGqiSAoiIFUAetqqCML0MHvndQ9qidBWstaa2ICEPtoejQmY24_Lv9VbQfiQdMa3vUtEeN-QZVsUQV</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Real World Mechanism for Testing Satisfiability in Polynomial Time</title><source>arXiv.org</source><creator>Schuh, Bernd R</creator><creatorcontrib>Schuh, Bernd R</creatorcontrib><description>Whether the satisfiability of any formula F of propositional calculus can be
determined in polynomial time is an open question. I propose a simple procedure
based on some real world mechanisms to tackle this problem. The main result is
the blueprint for a machine which is able to test any formula in conjunctive
normal form (CNF) for satisfiability in linear time. The device uses light and
some electrochemical properties to function. It adapts itself to the scope of
the problem without growing exponentially in mass with the size of the formula.
It requires infinite precision in its components instead.</description><identifier>DOI: 10.48550/arxiv.1001.3263</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Logic in Computer Science</subject><creationdate>2010-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1001.3263$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1001.3263$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Schuh, Bernd R</creatorcontrib><title>A Real World Mechanism for Testing Satisfiability in Polynomial Time</title><description>Whether the satisfiability of any formula F of propositional calculus can be
determined in polynomial time is an open question. I propose a simple procedure
based on some real world mechanisms to tackle this problem. The main result is
the blueprint for a machine which is able to test any formula in conjunctive
normal form (CNF) for satisfiability in linear time. The device uses light and
some electrochemical properties to function. It adapts itself to the scope of
the problem without growing exponentially in mass with the size of the formula.
It requires infinite precision in its components instead.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz01LxDAUheFsXMjo3pXkD7QmTW-aLofxE2ZQtOCy3LQ3eiFtJS1i_72Oujqr98AjxIVWeekA1BWmL_7MtVI6N4U1p-J6K58Jo3ydUuzlgbp3HHkeZJiSbGheeHyTL7jwHBg9R15WyaN8muI6TgP_hA0PdCZOAsaZzv93I5rbm2Z3n-0f7x52232GFkxmC116VwOGqiSAoiIFUAetqqCML0MHvndQ9qidBWstaa2ICEPtoejQmY24_Lv9VbQfiQdMa3vUtEeN-QZVsUQV</recordid><startdate>20100119</startdate><enddate>20100119</enddate><creator>Schuh, Bernd R</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20100119</creationdate><title>A Real World Mechanism for Testing Satisfiability in Polynomial Time</title><author>Schuh, Bernd R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a653-6214b895af74e5527e0559f107f03b4fc5bd854da1865666e110eeeaf9b52ca83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Schuh, Bernd R</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schuh, Bernd R</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Real World Mechanism for Testing Satisfiability in Polynomial Time</atitle><date>2010-01-19</date><risdate>2010</risdate><abstract>Whether the satisfiability of any formula F of propositional calculus can be
determined in polynomial time is an open question. I propose a simple procedure
based on some real world mechanisms to tackle this problem. The main result is
the blueprint for a machine which is able to test any formula in conjunctive
normal form (CNF) for satisfiability in linear time. The device uses light and
some electrochemical properties to function. It adapts itself to the scope of
the problem without growing exponentially in mass with the size of the formula.
It requires infinite precision in its components instead.</abstract><doi>10.48550/arxiv.1001.3263</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1001.3263 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1001_3263 |
| source | arXiv.org |
| subjects | Computer Science - Computational Complexity Computer Science - Logic in Computer Science |
| title | A Real World Mechanism for Testing Satisfiability in Polynomial Time |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T15%3A22%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Real%20World%20Mechanism%20for%20Testing%20Satisfiability%20in%20Polynomial%20Time&rft.au=Schuh,%20Bernd%20R&rft.date=2010-01-19&rft_id=info:doi/10.48550/arxiv.1001.3263&rft_dat=%3Carxiv_GOX%3E1001_3263%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |