The undecidable: basic papers on undecidable propositions, unsolvable problems, and computable functions
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hewlett, NY
Raven Pr.
1965
|
| Schlagworte: | |
| Beschreibung: | 440 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV007027298 | ||
| 003 | DE-604 | ||
| 005 | 20221019 | ||
| 007 | t | ||
| 008 | 930415s1965 |||| 00||| eng d | ||
| 035 | |a (OCoLC)232930 | ||
| 035 | |a (DE-599)BVBBV007027298 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 |a DE-29 |a DE-29T |a DE-188 | ||
| 050 | 0 | |a QA248.5 | |
| 082 | 0 | |a 512.8 | |
| 084 | |a CC 2600 |0 (DE-625)17610: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 245 | 1 | 0 | |a The undecidable |b basic papers on undecidable propositions, unsolvable problems, and computable functions |c ed. by Martin Davis |
| 264 | 1 | |a Hewlett, NY |b Raven Pr. |c 1965 | |
| 300 | |a 440 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Fonctions calculables | |
| 650 | 7 | |a Fonctions calculables |2 ram | |
| 650 | 4 | |a Fonctions récursives | |
| 650 | 7 | |a Fonctions récursives |2 ram | |
| 650 | 4 | |a Gödel, Théorème de | |
| 650 | 7 | |a Gödel, Théorème de |2 ram | |
| 650 | 4 | |a Non-résolubilité (Logique mathématique) | |
| 650 | 7 | |a Non-résolubilité (logique mathématique) |2 ram | |
| 650 | 4 | |a Turing, Machines de | |
| 650 | 7 | |a Turing, Machines de |2 ram | |
| 650 | 7 | |a calcul propositionnel |2 inriac | |
| 650 | 7 | |a indécidabilité |2 inriac | |
| 650 | 7 | |a insolubilité |2 inriac | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Gödel's theorem | |
| 650 | 4 | |a Recursive functions | |
| 650 | 4 | |a Turing machines | |
| 650 | 4 | |a Unsolvability (Mathematical logic) | |
| 650 | 0 | 7 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Davis, Martin |d 1928-2023 |0 (DE-588)116040866 |4 edt | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004456224 | ||
Datensatz im Suchindex
| _version_ | 1804121194325082112 |
|---|---|
| any_adam_object | |
| author2 | Davis, Martin 1928-2023 |
| author2_role | edt |
| author2_variant | m d md |
| author_GND | (DE-588)116040866 |
| author_facet | Davis, Martin 1928-2023 |
| building | Verbundindex |
| bvnumber | BV007027298 |
| callnumber-first | Q - Science |
| callnumber-label | QA248 |
| callnumber-raw | QA248.5 |
| callnumber-search | QA248.5 |
| callnumber-sort | QA 3248.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | CC 2600 ST 130 |
| ctrlnum | (OCoLC)232930 (DE-599)BVBBV007027298 |
| dewey-full | 512.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.8 |
| dewey-search | 512.8 |
| dewey-sort | 3512.8 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Philosophie |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01797nam a2200541 c 4500</leader><controlfield tag="001">BV007027298</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221019 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930415s1965 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)232930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV007027298</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-355</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA248.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.8</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="0">(DE-625)17610:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The undecidable</subfield><subfield code="b">basic papers on undecidable propositions, unsolvable problems, and computable functions</subfield><subfield code="c">ed. by Martin Davis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hewlett, NY</subfield><subfield code="b">Raven Pr.</subfield><subfield code="c">1965</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">440 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="650" ind1=" " ind2="4"><subfield code="a">Fonctions calculables</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions calculables</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions récursives</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions récursives</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gödel, Théorème de</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Gödel, Théorème de</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-résolubilité (Logique mathématique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-résolubilité (logique mathématique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing, Machines de</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Turing, Machines de</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calcul propositionnel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">indécidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">insolubilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gödel's theorem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Unsolvability (Mathematical logic)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">edt</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004456224</subfield></datafield></record></collection> |
| id | DE-604.BV007027298 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:54:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004456224 |
| oclc_num | 232930 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-29 DE-29T DE-188 |
| owner_facet | DE-355 DE-BY-UBR DE-29 DE-29T DE-188 |
| physical | 440 S. |
| publishDate | 1965 |
| publishDateSearch | 1965 |
| publishDateSort | 1965 |
| publisher | Raven Pr. |
| record_format | marc |
| spelling | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions ed. by Martin Davis Hewlett, NY Raven Pr. 1965 440 S. txt rdacontent n rdamedia nc rdacarrier Fonctions calculables Fonctions calculables ram Fonctions récursives Fonctions récursives ram Gödel, Théorème de Gödel, Théorème de ram Non-résolubilité (Logique mathématique) Non-résolubilité (logique mathématique) ram Turing, Machines de Turing, Machines de ram calcul propositionnel inriac indécidabilité inriac insolubilité inriac Computable functions Gödel's theorem Recursive functions Turing machines Unsolvability (Mathematical logic) Entscheidbarkeit (DE-588)4152398-2 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 s DE-604 Davis, Martin 1928-2023 (DE-588)116040866 edt |
| spellingShingle | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions Fonctions calculables Fonctions calculables ram Fonctions récursives Fonctions récursives ram Gödel, Théorème de Gödel, Théorème de ram Non-résolubilité (Logique mathématique) Non-résolubilité (logique mathématique) ram Turing, Machines de Turing, Machines de ram calcul propositionnel inriac indécidabilité inriac insolubilité inriac Computable functions Gödel's theorem Recursive functions Turing machines Unsolvability (Mathematical logic) Entscheidbarkeit (DE-588)4152398-2 gnd |
| subject_GND | (DE-588)4152398-2 |
| title | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions |
| title_auth | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions |
| title_exact_search | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions |
| title_full | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions ed. by Martin Davis |
| title_fullStr | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions ed. by Martin Davis |
| title_full_unstemmed | The undecidable basic papers on undecidable propositions, unsolvable problems, and computable functions ed. by Martin Davis |
| title_short | The undecidable |
| title_sort | the undecidable basic papers on undecidable propositions unsolvable problems and computable functions |
| title_sub | basic papers on undecidable propositions, unsolvable problems, and computable functions |
| topic | Fonctions calculables Fonctions calculables ram Fonctions récursives Fonctions récursives ram Gödel, Théorème de Gödel, Théorème de ram Non-résolubilité (Logique mathématique) Non-résolubilité (logique mathématique) ram Turing, Machines de Turing, Machines de ram calcul propositionnel inriac indécidabilité inriac insolubilité inriac Computable functions Gödel's theorem Recursive functions Turing machines Unsolvability (Mathematical logic) Entscheidbarkeit (DE-588)4152398-2 gnd |
| topic_facet | Fonctions calculables Fonctions récursives Gödel, Théorème de Non-résolubilité (Logique mathématique) Non-résolubilité (logique mathématique) Turing, Machines de calcul propositionnel indécidabilité insolubilité Computable functions Gödel's theorem Recursive functions Turing machines Unsolvability (Mathematical logic) Entscheidbarkeit |
| work_keys_str_mv | AT davismartin theundecidablebasicpapersonundecidablepropositionsunsolvableproblemsandcomputablefunctions |