On the complexity of nonuniform wavelength-based machine
The wavelength-based machine, or simply w -machine, is an optical computational model, which is designed based on simultaneous movement of several wavelengths in a single light ray, and simultaneous effect of simple optical devices on them. In this paper, we investigate nonuniform complexity classes...
Gespeichert in:
| Veröffentlicht in: | Natural computing 2014-06, Vol.13 (2), p.269-283 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 283 |
|---|---|
| container_issue | 2 |
| container_start_page | 269 |
| container_title | Natural computing |
| container_volume | 13 |
| creator | Goliaei, Sama Foroughmand-Araabi, Mohammad-Hadi |
| description | The wavelength-based machine, or simply
w
-machine, is an optical computational model, which is designed based on simultaneous movement of several wavelengths in a single light ray, and simultaneous effect of simple optical devices on them. In this paper, we investigate nonuniform complexity classes of
w
-machine, based on three complexity measures, namely, size, time, and word length. We show that the class of languages which can be generated by constant size nonuniform
w
-machines contain infinitely many Turing undecidable languages. Also, we show that polynomial size nonuniform
w
-machines generate all NP languages, and every NP-hard language requires at least polynomial time and polynomial size nonuniform
w
-machines to be generated. We prove that the class of languages which can be generated by polynomial size nonuniform
w
-machines is equal to NP/poly, and almost all languages require exponential size and polynomial time nonuniform
w
-machines to be generated. |
| doi_str_mv | 10.1007/s11047-014-9412-2 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1541416090</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3296595631</sourcerecordid><originalsourceid>FETCH-LOGICAL-c419t-348bb043b24d17b1374f42e4974b4b197773056b193f79faae0b6547a1be74823</originalsourceid><addsrcrecordid>eNp1kMtOwzAQRS0EEqXwAewisWFj8DiTTLxEFS-pUjewtuzUaVMldokTHn9PqrBASKzmLs69Gh3GLkHcgBB0GwEEEheAXCFILo_YDDKSXJHKjw85J04FFKfsLMadEBKyDGasWPmk37qkDO2-cZ91_5WEKvHBD76uQtcmH-bdNc5v-i23Jrp10ppyW3t3zk4q00R38XPn7PXh_mXxxJerx-fF3ZKXCKrnKRbWCkytxDWQhZSwQulQEVq0oIgoFVk-prQiVRnjhM0zJAPWERYynbPraXffhbfBxV63dSxd0xjvwhA1ZAgIuVBiRK_-oLswdH78bqQkFIpymY8UTFTZhRg7V-l9V7em-9Ig9MGlnlzq0aU-uNSHJ-TUiSPrN677tfxv6RtQSHRn</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1521897626</pqid></control><display><type>article</type><title>On the complexity of nonuniform wavelength-based machine</title><source>SpringerLink Journals - AutoHoldings</source><creator>Goliaei, Sama ; Foroughmand-Araabi, Mohammad-Hadi</creator><creatorcontrib>Goliaei, Sama ; Foroughmand-Araabi, Mohammad-Hadi</creatorcontrib><description>The wavelength-based machine, or simply
w
-machine, is an optical computational model, which is designed based on simultaneous movement of several wavelengths in a single light ray, and simultaneous effect of simple optical devices on them. In this paper, we investigate nonuniform complexity classes of
w
-machine, based on three complexity measures, namely, size, time, and word length. We show that the class of languages which can be generated by constant size nonuniform
w
-machines contain infinitely many Turing undecidable languages. Also, we show that polynomial size nonuniform
w
-machines generate all NP languages, and every NP-hard language requires at least polynomial time and polynomial size nonuniform
w
-machines to be generated. We prove that the class of languages which can be generated by polynomial size nonuniform
w
-machines is equal to NP/poly, and almost all languages require exponential size and polynomial time nonuniform
w
-machines to be generated.</description><identifier>ISSN: 1567-7818</identifier><identifier>EISSN: 1572-9796</identifier><identifier>DOI: 10.1007/s11047-014-9412-2</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Artificial Intelligence ; Complex Systems ; Complexity ; Computation ; Computer engineering ; Computer Science ; Devices ; Evolutionary Biology ; Movement ; Nonuniform ; Polynomials ; Processor Architectures ; Theory of Computation ; Wavelengths</subject><ispartof>Natural computing, 2014-06, Vol.13 (2), p.269-283</ispartof><rights>Springer Science+Business Media Dordrecht 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c419t-348bb043b24d17b1374f42e4974b4b197773056b193f79faae0b6547a1be74823</citedby><cites>FETCH-LOGICAL-c419t-348bb043b24d17b1374f42e4974b4b197773056b193f79faae0b6547a1be74823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11047-014-9412-2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11047-014-9412-2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Goliaei, Sama</creatorcontrib><creatorcontrib>Foroughmand-Araabi, Mohammad-Hadi</creatorcontrib><title>On the complexity of nonuniform wavelength-based machine</title><title>Natural computing</title><addtitle>Nat Comput</addtitle><description>The wavelength-based machine, or simply
w
-machine, is an optical computational model, which is designed based on simultaneous movement of several wavelengths in a single light ray, and simultaneous effect of simple optical devices on them. In this paper, we investigate nonuniform complexity classes of
w
-machine, based on three complexity measures, namely, size, time, and word length. We show that the class of languages which can be generated by constant size nonuniform
w
-machines contain infinitely many Turing undecidable languages. Also, we show that polynomial size nonuniform
w
-machines generate all NP languages, and every NP-hard language requires at least polynomial time and polynomial size nonuniform
w
-machines to be generated. We prove that the class of languages which can be generated by polynomial size nonuniform
w
-machines is equal to NP/poly, and almost all languages require exponential size and polynomial time nonuniform
w
-machines to be generated.</description><subject>Artificial Intelligence</subject><subject>Complex Systems</subject><subject>Complexity</subject><subject>Computation</subject><subject>Computer engineering</subject><subject>Computer Science</subject><subject>Devices</subject><subject>Evolutionary Biology</subject><subject>Movement</subject><subject>Nonuniform</subject><subject>Polynomials</subject><subject>Processor Architectures</subject><subject>Theory of Computation</subject><subject>Wavelengths</subject><issn>1567-7818</issn><issn>1572-9796</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kMtOwzAQRS0EEqXwAewisWFj8DiTTLxEFS-pUjewtuzUaVMldokTHn9PqrBASKzmLs69Gh3GLkHcgBB0GwEEEheAXCFILo_YDDKSXJHKjw85J04FFKfsLMadEBKyDGasWPmk37qkDO2-cZ91_5WEKvHBD76uQtcmH-bdNc5v-i23Jrp10ppyW3t3zk4q00R38XPn7PXh_mXxxJerx-fF3ZKXCKrnKRbWCkytxDWQhZSwQulQEVq0oIgoFVk-prQiVRnjhM0zJAPWERYynbPraXffhbfBxV63dSxd0xjvwhA1ZAgIuVBiRK_-oLswdH78bqQkFIpymY8UTFTZhRg7V-l9V7em-9Ig9MGlnlzq0aU-uNSHJ-TUiSPrN677tfxv6RtQSHRn</recordid><startdate>20140601</startdate><enddate>20140601</enddate><creator>Goliaei, Sama</creator><creator>Foroughmand-Araabi, Mohammad-Hadi</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>20140601</creationdate><title>On the complexity of nonuniform wavelength-based machine</title><author>Goliaei, Sama ; Foroughmand-Araabi, Mohammad-Hadi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c419t-348bb043b24d17b1374f42e4974b4b197773056b193f79faae0b6547a1be74823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Artificial Intelligence</topic><topic>Complex Systems</topic><topic>Complexity</topic><topic>Computation</topic><topic>Computer engineering</topic><topic>Computer Science</topic><topic>Devices</topic><topic>Evolutionary Biology</topic><topic>Movement</topic><topic>Nonuniform</topic><topic>Polynomials</topic><topic>Processor Architectures</topic><topic>Theory of Computation</topic><topic>Wavelengths</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Goliaei, Sama</creatorcontrib><creatorcontrib>Foroughmand-Araabi, Mohammad-Hadi</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>Natural computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Goliaei, Sama</au><au>Foroughmand-Araabi, Mohammad-Hadi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the complexity of nonuniform wavelength-based machine</atitle><jtitle>Natural computing</jtitle><stitle>Nat Comput</stitle><date>2014-06-01</date><risdate>2014</risdate><volume>13</volume><issue>2</issue><spage>269</spage><epage>283</epage><pages>269-283</pages><issn>1567-7818</issn><eissn>1572-9796</eissn><abstract>The wavelength-based machine, or simply
w
-machine, is an optical computational model, which is designed based on simultaneous movement of several wavelengths in a single light ray, and simultaneous effect of simple optical devices on them. In this paper, we investigate nonuniform complexity classes of
w
-machine, based on three complexity measures, namely, size, time, and word length. We show that the class of languages which can be generated by constant size nonuniform
w
-machines contain infinitely many Turing undecidable languages. Also, we show that polynomial size nonuniform
w
-machines generate all NP languages, and every NP-hard language requires at least polynomial time and polynomial size nonuniform
w
-machines to be generated. We prove that the class of languages which can be generated by polynomial size nonuniform
w
-machines is equal to NP/poly, and almost all languages require exponential size and polynomial time nonuniform
w
-machines to be generated.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s11047-014-9412-2</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1567-7818 |
| ispartof | Natural computing, 2014-06, Vol.13 (2), p.269-283 |
| issn | 1567-7818 1572-9796 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1541416090 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Artificial Intelligence Complex Systems Complexity Computation Computer engineering Computer Science Devices Evolutionary Biology Movement Nonuniform Polynomials Processor Architectures Theory of Computation Wavelengths |
| title | On the complexity of nonuniform wavelength-based machine |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A59%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20complexity%20of%20nonuniform%20wavelength-based%20machine&rft.jtitle=Natural%20computing&rft.au=Goliaei,%20Sama&rft.date=2014-06-01&rft.volume=13&rft.issue=2&rft.spage=269&rft.epage=283&rft.pages=269-283&rft.issn=1567-7818&rft.eissn=1572-9796&rft_id=info:doi/10.1007/s11047-014-9412-2&rft_dat=%3Cproquest_cross%3E3296595631%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1521897626&rft_id=info:pmid/&rfr_iscdi=true |