Computability and unsolvability:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
Dover
1982
|
| Ausgabe: | Enlarged version |
| Schlagworte: | |
| Beschreibung: | XXV, 248 S. |
| ISBN: | 0486614719 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV003662341 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 900725s1982 |||| 00||| eng d | ||
| 020 | |a 0486614719 |9 0-486-61471-9 | ||
| 035 | |a (OCoLC)468056485 | ||
| 035 | |a (DE-599)BVBBV003662341 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-11 | ||
| 082 | 1 | |a 511.3 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Davis, Martin |d 1928-2023 |e Verfasser |0 (DE-588)116040866 |4 aut | |
| 245 | 1 | 0 | |a Computability and unsolvability |
| 250 | |a Enlarged version | ||
| 264 | 1 | |a New York |b Dover |c 1982 | |
| 300 | |a XXV, 248 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Fonctions calculables |2 ram | |
| 650 | 7 | |a Fonctions récursives |2 ram | |
| 650 | 7 | |a calculabilité |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a fonction calcul |2 inriac | |
| 650 | 7 | |a fonction récursive |2 inriac | |
| 650 | 7 | |a hiérarchie Kleene fonctionnelle |2 inriac | |
| 650 | 7 | |a insolubilité |2 inriac | |
| 650 | 7 | |a logique mathématique |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 7 | |a problème décision |2 inriac | |
| 650 | 7 | |a récursivité |2 inriac | |
| 650 | 7 | |a équation diophantienne |2 inriac | |
| 650 | 0 | 7 | |a Unlösbarkeit |0 (DE-588)4426195-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Unlösbarkeit |0 (DE-588)4426195-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002331276 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804118008985026560 |
|---|---|
| any_adam_object | |
| author | Davis, Martin 1928-2023 |
| author_GND | (DE-588)116040866 |
| author_facet | Davis, Martin 1928-2023 |
| author_role | aut |
| author_sort | Davis, Martin 1928-2023 |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | BV003662341 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)468056485 (DE-599)BVBBV003662341 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | Enlarged version |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01914nam a2200577 c 4500</leader><controlfield tag="001">BV003662341</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1982 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0486614719</subfield><subfield code="9">0-486-61471-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)468056485</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003662341</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-384</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="1" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</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="100" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and unsolvability</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Enlarged version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Dover</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXV, 248 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="7"><subfield code="a">Fonctions calculables</subfield><subfield code="2">ram</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="7"><subfield code="a">calculabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fonction calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fonction récursive</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">hiérarchie Kleene fonctionnelle</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="7"><subfield code="a">logique mathématique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">problème décision</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">récursivité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">équation diophantienne</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Unlösbarkeit</subfield><subfield code="0">(DE-588)4426195-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Unlösbarkeit</subfield><subfield code="0">(DE-588)4426195-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002331276</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV003662341 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:03:28Z |
| institution | BVB |
| isbn | 0486614719 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002331276 |
| oclc_num | 468056485 |
| open_access_boolean | |
| owner | DE-384 DE-11 |
| owner_facet | DE-384 DE-11 |
| physical | XXV, 248 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| publisher | Dover |
| record_format | marc |
| spelling | Davis, Martin 1928-2023 Verfasser (DE-588)116040866 aut Computability and unsolvability Enlarged version New York Dover 1982 XXV, 248 S. txt rdacontent n rdamedia nc rdacarrier Fonctions calculables ram Fonctions récursives ram calculabilité inriac combinatoire inriac décidabilité inriac fonction calcul inriac fonction récursive inriac hiérarchie Kleene fonctionnelle inriac insolubilité inriac logique mathématique inriac machine Turing inriac problème décision inriac récursivité inriac équation diophantienne inriac Unlösbarkeit (DE-588)4426195-0 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s DE-604 Unlösbarkeit (DE-588)4426195-0 s Turing-Maschine (DE-588)4203525-9 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Davis, Martin 1928-2023 Computability and unsolvability Fonctions calculables ram Fonctions récursives ram calculabilité inriac combinatoire inriac décidabilité inriac fonction calcul inriac fonction récursive inriac hiérarchie Kleene fonctionnelle inriac insolubilité inriac logique mathématique inriac machine Turing inriac problème décision inriac récursivité inriac équation diophantienne inriac Unlösbarkeit (DE-588)4426195-0 gnd Turing-Maschine (DE-588)4203525-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4426195-0 (DE-588)4203525-9 (DE-588)4138368-0 |
| title | Computability and unsolvability |
| title_auth | Computability and unsolvability |
| title_exact_search | Computability and unsolvability |
| title_full | Computability and unsolvability |
| title_fullStr | Computability and unsolvability |
| title_full_unstemmed | Computability and unsolvability |
| title_short | Computability and unsolvability |
| title_sort | computability and unsolvability |
| topic | Fonctions calculables ram Fonctions récursives ram calculabilité inriac combinatoire inriac décidabilité inriac fonction calcul inriac fonction récursive inriac hiérarchie Kleene fonctionnelle inriac insolubilité inriac logique mathématique inriac machine Turing inriac problème décision inriac récursivité inriac équation diophantienne inriac Unlösbarkeit (DE-588)4426195-0 gnd Turing-Maschine (DE-588)4203525-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Fonctions calculables Fonctions récursives calculabilité combinatoire décidabilité fonction calcul fonction récursive hiérarchie Kleene fonctionnelle insolubilité logique mathématique machine Turing problème décision récursivité équation diophantienne Unlösbarkeit Turing-Maschine Berechenbarkeit |
| work_keys_str_mv | AT davismartin computabilityandunsolvability |