A survey of some recent results on computational complexity in weak theories of arithmetic:
In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for algorithms and trying to solve the P = NP question, only limited progress has been made. Although most computer scientists remain convinced that solutions will be found, others (Hartmanis and Hopcroft...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1982
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
502 |
| Zusammenfassung: | In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for algorithms and trying to solve the P = NP question, only limited progress has been made. Although most computer scientists remain convinced that solutions will be found, others (Hartmanis and Hopcroft, Fortune, Leivant and O'Donnell and Phillips) have questioned the adequacy of Peano arithmetic for computer science. This uncertainty has only been increased by the recent work of Paris and Harrington, showing that certain simple, finistic, combinatorial statements are in fact independent of Peano Arithmetic. In this paper we survey complexity theoretic statements that are known to be independent of arithmetic theories. In addition, we survey recent results analyzing the arithmetic quantifier structure of computational problems Keywords: Independence results, NP=?coNP, P=?NP, Peano arithmetic |
| Beschreibung: | 22 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010582178 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960123s1982 |||| 00||| engod | ||
| 035 | |a (OCoLC)10690700 | ||
| 035 | |a (DE-599)BVBBV010582178 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA248 | |
| 100 | 1 | |a Joseph, Deborah A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A survey of some recent results on computational complexity in weak theories of arithmetic |c D. A. Joseph ; P. R. Young |
| 264 | 1 | |a Ithaca, New York |c 1982 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 502 | |
| 520 | 3 | |a In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for algorithms and trying to solve the P = NP question, only limited progress has been made. Although most computer scientists remain convinced that solutions will be found, others (Hartmanis and Hopcroft, Fortune, Leivant and O'Donnell and Phillips) have questioned the adequacy of Peano arithmetic for computer science. This uncertainty has only been increased by the recent work of Paris and Harrington, showing that certain simple, finistic, combinatorial statements are in fact independent of Peano Arithmetic. In this paper we survey complexity theoretic statements that are known to be independent of arithmetic theories. In addition, we survey recent results analyzing the arithmetic quantifier structure of computational problems | |
| 520 | 3 | |a Keywords: Independence results, NP=?coNP, P=?NP, Peano arithmetic | |
| 700 | 1 | |a Young, Paul R. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 502 |w (DE-604)BV006185504 |9 502 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007055115 | ||
Datensatz im Suchindex
| _version_ | 1804125051252899840 |
|---|---|
| any_adam_object | |
| author | Joseph, Deborah A. Young, Paul R. |
| author_facet | Joseph, Deborah A. Young, Paul R. |
| author_role | aut aut |
| author_sort | Joseph, Deborah A. |
| author_variant | d a j da daj p r y pr pry |
| building | Verbundindex |
| bvnumber | BV010582178 |
| callnumber-first | Q - Science |
| callnumber-label | QA248 |
| callnumber-raw | QA248 |
| callnumber-search | QA248 |
| callnumber-sort | QA 3248 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)10690700 (DE-599)BVBBV010582178 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01945nam a2200313 cb4500</leader><controlfield tag="001">BV010582178</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960123s1982 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)10690700</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010582178</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA248</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Joseph, Deborah A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A survey of some recent results on computational complexity in weak theories of arithmetic</subfield><subfield code="c">D. A. Joseph ; P. R. Young</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">502</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for algorithms and trying to solve the P = NP question, only limited progress has been made. Although most computer scientists remain convinced that solutions will be found, others (Hartmanis and Hopcroft, Fortune, Leivant and O'Donnell and Phillips) have questioned the adequacy of Peano arithmetic for computer science. This uncertainty has only been increased by the recent work of Paris and Harrington, showing that certain simple, finistic, combinatorial statements are in fact independent of Peano Arithmetic. In this paper we survey complexity theoretic statements that are known to be independent of arithmetic theories. In addition, we survey recent results analyzing the arithmetic quantifier structure of computational problems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Keywords: Independence results, NP=?coNP, P=?NP, Peano arithmetic</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Young, Paul R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">502</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">502</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007055115</subfield></datafield></record></collection> |
| id | DE-604.BV010582178 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007055115 |
| oclc_num | 10690700 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 22 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Joseph, Deborah A. Verfasser aut A survey of some recent results on computational complexity in weak theories of arithmetic D. A. Joseph ; P. R. Young Ithaca, New York 1982 22 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 502 In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for algorithms and trying to solve the P = NP question, only limited progress has been made. Although most computer scientists remain convinced that solutions will be found, others (Hartmanis and Hopcroft, Fortune, Leivant and O'Donnell and Phillips) have questioned the adequacy of Peano arithmetic for computer science. This uncertainty has only been increased by the recent work of Paris and Harrington, showing that certain simple, finistic, combinatorial statements are in fact independent of Peano Arithmetic. In this paper we survey complexity theoretic statements that are known to be independent of arithmetic theories. In addition, we survey recent results analyzing the arithmetic quantifier structure of computational problems Keywords: Independence results, NP=?coNP, P=?NP, Peano arithmetic Young, Paul R. Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 502 (DE-604)BV006185504 502 |
| spellingShingle | Joseph, Deborah A. Young, Paul R. A survey of some recent results on computational complexity in weak theories of arithmetic |
| title | A survey of some recent results on computational complexity in weak theories of arithmetic |
| title_auth | A survey of some recent results on computational complexity in weak theories of arithmetic |
| title_exact_search | A survey of some recent results on computational complexity in weak theories of arithmetic |
| title_full | A survey of some recent results on computational complexity in weak theories of arithmetic D. A. Joseph ; P. R. Young |
| title_fullStr | A survey of some recent results on computational complexity in weak theories of arithmetic D. A. Joseph ; P. R. Young |
| title_full_unstemmed | A survey of some recent results on computational complexity in weak theories of arithmetic D. A. Joseph ; P. R. Young |
| title_short | A survey of some recent results on computational complexity in weak theories of arithmetic |
| title_sort | a survey of some recent results on computational complexity in weak theories of arithmetic |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT josephdeboraha asurveyofsomerecentresultsoncomputationalcomplexityinweaktheoriesofarithmetic AT youngpaulr asurveyofsomerecentresultsoncomputationalcomplexityinweaktheoriesofarithmetic |