Conversations: from Alan Turing to NP-completeness
Gespeichert in:
| Veröffentlicht in: | Current science (Bangalore) 2014-06, Vol.106 (12), p.1696-1701 |
|---|---|
| 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 | 1701 |
|---|---|
| container_issue | 12 |
| container_start_page | 1696 |
| container_title | Current science (Bangalore) |
| container_volume | 106 |
| creator | Radhakrishnan, Jaikumar Cook, Stephen A. Gopalkrishnan, Manoj Parikh, Rohit J. Sohoni, Milind |
| description | |
| format | Article |
| fullrecord | <record><control><sourceid>jstor</sourceid><recordid>TN_cdi_jstor_primary_24103004</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>24103004</jstor_id><sourcerecordid>24103004</sourcerecordid><originalsourceid>FETCH-LOGICAL-j177t-a1b11d8f3b31b873b8bdd747bfd750c2b4aa72f4acf4cbd3173e4af34c3e55403</originalsourceid><addsrcrecordid>eNotzMtKAzEUANAsKlirnyDkBwL35mbItLsy-IKiLuq65CkzzCQlSQv-vQtdnd1ZsTUAoqB-i7fsrtYJQJKE7ZrJIadrKNW0Mae647Hkhe9nk_jxUsb0zVvm75_C5eU8hxZSqPWe3UQz1_Dw74Z9PT8dh1dx-Hh5G_YHMaHWTRi0iL6PZAltr8n21nuttI1ed-CkVcZoGZVxUTnrCTUFZSIpR6HrFNCGPf69U225nM5lXEz5OUmFQACKfgFuJT2B</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Conversations: from Alan Turing to NP-completeness</title><source>Jstor Complete Legacy</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Radhakrishnan, Jaikumar ; Cook, Stephen A. ; Gopalkrishnan, Manoj ; Parikh, Rohit J. ; Sohoni, Milind</creator><creatorcontrib>Radhakrishnan, Jaikumar ; Cook, Stephen A. ; Gopalkrishnan, Manoj ; Parikh, Rohit J. ; Sohoni, Milind</creatorcontrib><identifier>ISSN: 0011-3891</identifier><language>eng</language><publisher>Current Science Association</publisher><subject>Computational complexity ; Computer science ; Geometric shapes ; Justified beliefs ; Mathematical functions ; Mathematics ; Physics ; Quantum mechanics ; Socratic philosophy ; SPECIAL SECTION: THEORY OF COMPUTATION ; Turing machines</subject><ispartof>Current science (Bangalore), 2014-06, Vol.106 (12), p.1696-1701</ispartof><rights>2014 Current Science Association</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/24103004$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/24103004$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,57992,58225</link.rule.ids></links><search><creatorcontrib>Radhakrishnan, Jaikumar</creatorcontrib><creatorcontrib>Cook, Stephen A.</creatorcontrib><creatorcontrib>Gopalkrishnan, Manoj</creatorcontrib><creatorcontrib>Parikh, Rohit J.</creatorcontrib><creatorcontrib>Sohoni, Milind</creatorcontrib><title>Conversations: from Alan Turing to NP-completeness</title><title>Current science (Bangalore)</title><subject>Computational complexity</subject><subject>Computer science</subject><subject>Geometric shapes</subject><subject>Justified beliefs</subject><subject>Mathematical functions</subject><subject>Mathematics</subject><subject>Physics</subject><subject>Quantum mechanics</subject><subject>Socratic philosophy</subject><subject>SPECIAL SECTION: THEORY OF COMPUTATION</subject><subject>Turing machines</subject><issn>0011-3891</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNotzMtKAzEUANAsKlirnyDkBwL35mbItLsy-IKiLuq65CkzzCQlSQv-vQtdnd1ZsTUAoqB-i7fsrtYJQJKE7ZrJIadrKNW0Mae647Hkhe9nk_jxUsb0zVvm75_C5eU8hxZSqPWe3UQz1_Dw74Z9PT8dh1dx-Hh5G_YHMaHWTRi0iL6PZAltr8n21nuttI1ed-CkVcZoGZVxUTnrCTUFZSIpR6HrFNCGPf69U225nM5lXEz5OUmFQACKfgFuJT2B</recordid><startdate>20140625</startdate><enddate>20140625</enddate><creator>Radhakrishnan, Jaikumar</creator><creator>Cook, Stephen A.</creator><creator>Gopalkrishnan, Manoj</creator><creator>Parikh, Rohit J.</creator><creator>Sohoni, Milind</creator><general>Current Science Association</general><scope/></search><sort><creationdate>20140625</creationdate><title>Conversations: from Alan Turing to NP-completeness</title><author>Radhakrishnan, Jaikumar ; Cook, Stephen A. ; Gopalkrishnan, Manoj ; Parikh, Rohit J. ; Sohoni, Milind</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j177t-a1b11d8f3b31b873b8bdd747bfd750c2b4aa72f4acf4cbd3173e4af34c3e55403</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Computational complexity</topic><topic>Computer science</topic><topic>Geometric shapes</topic><topic>Justified beliefs</topic><topic>Mathematical functions</topic><topic>Mathematics</topic><topic>Physics</topic><topic>Quantum mechanics</topic><topic>Socratic philosophy</topic><topic>SPECIAL SECTION: THEORY OF COMPUTATION</topic><topic>Turing machines</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Radhakrishnan, Jaikumar</creatorcontrib><creatorcontrib>Cook, Stephen A.</creatorcontrib><creatorcontrib>Gopalkrishnan, Manoj</creatorcontrib><creatorcontrib>Parikh, Rohit J.</creatorcontrib><creatorcontrib>Sohoni, Milind</creatorcontrib><jtitle>Current science (Bangalore)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Radhakrishnan, Jaikumar</au><au>Cook, Stephen A.</au><au>Gopalkrishnan, Manoj</au><au>Parikh, Rohit J.</au><au>Sohoni, Milind</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Conversations: from Alan Turing to NP-completeness</atitle><jtitle>Current science (Bangalore)</jtitle><date>2014-06-25</date><risdate>2014</risdate><volume>106</volume><issue>12</issue><spage>1696</spage><epage>1701</epage><pages>1696-1701</pages><issn>0011-3891</issn><pub>Current Science Association</pub><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0011-3891 |
| ispartof | Current science (Bangalore), 2014-06, Vol.106 (12), p.1696-1701 |
| issn | 0011-3891 |
| language | eng |
| recordid | cdi_jstor_primary_24103004 |
| source | Jstor Complete Legacy; EZB-FREE-00999 freely available EZB journals |
| subjects | Computational complexity Computer science Geometric shapes Justified beliefs Mathematical functions Mathematics Physics Quantum mechanics Socratic philosophy SPECIAL SECTION: THEORY OF COMPUTATION Turing machines |
| title | Conversations: from Alan Turing to NP-completeness |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T21%3A46%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Conversations:%20from%20Alan%20Turing%20to%20NP-completeness&rft.jtitle=Current%20science%20(Bangalore)&rft.au=Radhakrishnan,%20Jaikumar&rft.date=2014-06-25&rft.volume=106&rft.issue=12&rft.spage=1696&rft.epage=1701&rft.pages=1696-1701&rft.issn=0011-3891&rft_id=info:doi/&rft_dat=%3Cjstor%3E24103004%3C/jstor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_jstor_id=24103004&rfr_iscdi=true |