Independence results in computer science:
During the last few years research in theoretical computer science has identified several problems whose solution seems to be important for the further development of the field and on which a considerable amout of research effort has been expended. In spite of all this effort these problems remain u...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1976
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
296 |
| Schlagworte: | |
| Zusammenfassung: | During the last few years research in theoretical computer science has identified several problems whose solution seems to be important for the further development of the field and on which a considerable amout of research effort has been expended. In spite of all this effort these problems remain unsolved and, no real progress seems to have been made toward their solution. Nevertheless, there remains real optimism that they will be solved and a deeply ingrained conviction that they can be solved. This note points out that many of these problems may not have a solution in formalized mathematical systems; more specifically, proof is shown that the solutions of many instances of these problems are independent of the axioms of set theory. |
| Beschreibung: | 12 Sp. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009887251 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941108s1976 |||| 00||| engod | ||
| 035 | |a (OCoLC)227457846 | ||
| 035 | |a (DE-599)BVBBV009887251 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Hartmanis, Juris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Independence results in computer science |c J. Hartmanis and J. E. Hopcroft |
| 264 | 1 | |a Ithaca, New York |c 1976 | |
| 300 | |a 12 Sp. | ||
| 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 296 | |
| 520 | 3 | |a During the last few years research in theoretical computer science has identified several problems whose solution seems to be important for the further development of the field and on which a considerable amout of research effort has been expended. In spite of all this effort these problems remain unsolved and, no real progress seems to have been made toward their solution. Nevertheless, there remains real optimism that they will be solved and a deeply ingrained conviction that they can be solved. This note points out that many of these problems may not have a solution in formalized mathematical systems; more specifically, proof is shown that the solutions of many instances of these problems are independent of the axioms of set theory. | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Turing machines | |
| 650 | 4 | |a WUNR044417 | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computers |2 dtict | |
| 650 | 7 | |a Mathematics |2 dtict | |
| 650 | 7 | |a Polynomials |2 dtict | |
| 650 | 7 | |a Recursive functions |2 dtict | |
| 650 | 7 | |a Scientific research |2 dtict | |
| 650 | 7 | |a Set theory |2 dtict | |
| 650 | 7 | |a Solutions(general) |2 dtict | |
| 650 | 7 | |a Theory |2 dtict | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 700 | 1 | |a Hopcroft, John E. |d 1939- |e Verfasser |0 (DE-588)112071481 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 296 |w (DE-604)BV006185504 |9 296 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006547004 | ||
Datensatz im Suchindex
| _version_ | 1804124245787148288 |
|---|---|
| any_adam_object | |
| author | Hartmanis, Juris Hopcroft, John E. 1939- |
| author_GND | (DE-588)112071481 |
| author_facet | Hartmanis, Juris Hopcroft, John E. 1939- |
| author_role | aut aut |
| author_sort | Hartmanis, Juris |
| author_variant | j h jh j e h je jeh |
| building | Verbundindex |
| bvnumber | BV009887251 |
| ctrlnum | (OCoLC)227457846 (DE-599)BVBBV009887251 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02285nam a2200481 cb4500</leader><controlfield tag="001">BV009887251</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941108s1976 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227457846</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009887251</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="100" ind1="1" ind2=" "><subfield code="a">Hartmanis, Juris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Independence results in computer science</subfield><subfield code="c">J. Hartmanis and J. E. Hopcroft</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 Sp.</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">296</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">During the last few years research in theoretical computer science has identified several problems whose solution seems to be important for the further development of the field and on which a considerable amout of research effort has been expended. In spite of all this effort these problems remain unsolved and, no real progress seems to have been made toward their solution. Nevertheless, there remains real optimism that they will be solved and a deeply ingrained conviction that they can be solved. This note points out that many of these problems may not have a solution in formalized mathematical systems; more specifically, proof is shown that the solutions of many instances of these problems are independent of the axioms of set theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">WUNR044417</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Polynomials</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursive functions</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Scientific research</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Set theory</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Solutions(general)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theory</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hopcroft, John E.</subfield><subfield code="d">1939-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)112071481</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">296</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">296</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006547004</subfield></datafield></record></collection> |
| id | DE-604.BV009887251 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006547004 |
| oclc_num | 227457846 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 Sp. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Hartmanis, Juris Verfasser aut Independence results in computer science J. Hartmanis and J. E. Hopcroft Ithaca, New York 1976 12 Sp. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 296 During the last few years research in theoretical computer science has identified several problems whose solution seems to be important for the further development of the field and on which a considerable amout of research effort has been expended. In spite of all this effort these problems remain unsolved and, no real progress seems to have been made toward their solution. Nevertheless, there remains real optimism that they will be solved and a deeply ingrained conviction that they can be solved. This note points out that many of these problems may not have a solution in formalized mathematical systems; more specifically, proof is shown that the solutions of many instances of these problems are independent of the axioms of set theory. Computer science Turing machines WUNR044417 Algorithms dtict Computations dtict Computer Hardware scgdst Computers dtict Mathematics dtict Polynomials dtict Recursive functions dtict Scientific research dtict Set theory dtict Solutions(general) dtict Theory dtict Informatik Mathematik Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 296 (DE-604)BV006185504 296 |
| spellingShingle | Hartmanis, Juris Hopcroft, John E. 1939- Independence results in computer science Computer science Turing machines WUNR044417 Algorithms dtict Computations dtict Computer Hardware scgdst Computers dtict Mathematics dtict Polynomials dtict Recursive functions dtict Scientific research dtict Set theory dtict Solutions(general) dtict Theory dtict Informatik Mathematik |
| title | Independence results in computer science |
| title_auth | Independence results in computer science |
| title_exact_search | Independence results in computer science |
| title_full | Independence results in computer science J. Hartmanis and J. E. Hopcroft |
| title_fullStr | Independence results in computer science J. Hartmanis and J. E. Hopcroft |
| title_full_unstemmed | Independence results in computer science J. Hartmanis and J. E. Hopcroft |
| title_short | Independence results in computer science |
| title_sort | independence results in computer science |
| topic | Computer science Turing machines WUNR044417 Algorithms dtict Computations dtict Computer Hardware scgdst Computers dtict Mathematics dtict Polynomials dtict Recursive functions dtict Scientific research dtict Set theory dtict Solutions(general) dtict Theory dtict Informatik Mathematik |
| topic_facet | Computer science Turing machines WUNR044417 Algorithms Computations Computer Hardware Computers Mathematics Polynomials Recursive functions Scientific research Set theory Solutions(general) Theory Informatik Mathematik |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT hartmanisjuris independenceresultsincomputerscience AT hopcroftjohne independenceresultsincomputerscience |