Introduction to computability:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Reading, Mass. u.a.
Addison-Wesley
1977
|
| Schriftenreihe: | Addison-Wesley series in computer science and information processing
|
| Schlagworte: | |
| Beschreibung: | IX, 374 S. graph. Darst. |
| ISBN: | 0201028484 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002301941 | ||
| 003 | DE-604 | ||
| 005 | 20141124 | ||
| 007 | t | ||
| 008 | 891128s1977 d||| |||| 00||| engod | ||
| 020 | |a 0201028484 |9 0-201-02848-4 | ||
| 035 | |a (OCoLC)2942333 | ||
| 035 | |a (DE-599)BVBBV002301941 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-739 |a DE-20 |a DE-29T |a DE-706 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA76.9.C62 | |
| 082 | 0 | |a 621.3819/52 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 03Dxx |2 msc | ||
| 100 | 1 | |a Hennie, Fred |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Introduction to computability |
| 264 | 1 | |a Reading, Mass. u.a. |b Addison-Wesley |c 1977 | |
| 300 | |a IX, 374 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Addison-Wesley series in computer science and information processing | |
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Fonctions calculables | |
| 650 | 4 | |a Fonctions récursives | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 7 | |a calculabilité |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a fonction récursive |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Recursive functions | |
| 650 | 4 | |a Turing machines | |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rekursivität |0 (DE-588)4443996-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Rekursivität |0 (DE-588)4443996-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001512841 | ||
Datensatz im Suchindex
| _version_ | 1804116762802782208 |
|---|---|
| any_adam_object | |
| author | Hennie, Fred |
| author_facet | Hennie, Fred |
| author_role | aut |
| author_sort | Hennie, Fred |
| author_variant | f h fh |
| building | Verbundindex |
| bvnumber | BV002301941 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.C62 |
| callnumber-search | QA76.9.C62 |
| callnumber-sort | QA 276.9 C62 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 |
| ctrlnum | (OCoLC)2942333 (DE-599)BVBBV002301941 |
| dewey-full | 621.3819/52 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.3819/52 |
| dewey-search | 621.3819/52 |
| dewey-sort | 3621.3819 252 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01865nam a2200577 c 4500</leader><controlfield tag="001">BV002301941</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141124 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">891128s1977 d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201028484</subfield><subfield code="9">0-201-02848-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)2942333</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002301941</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><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.C62</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3819/52</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="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">03Dxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hennie, Fred</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to computability</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. u.a.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 374 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Addison-Wesley series in computer science and information processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions calculables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions récursives</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</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">décidabilité</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">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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="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="650" ind1="0" ind2="7"><subfield code="a">Rekursivität</subfield><subfield code="0">(DE-588)4443996-9</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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Rekursivität</subfield><subfield code="0">(DE-588)4443996-9</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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001512841</subfield></datafield></record></collection> |
| id | DE-604.BV002301941 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:43:40Z |
| institution | BVB |
| isbn | 0201028484 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001512841 |
| oclc_num | 2942333 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-20 DE-29T DE-706 DE-83 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-20 DE-29T DE-706 DE-83 DE-188 |
| physical | IX, 374 S. graph. Darst. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| publisher | Addison-Wesley |
| record_format | marc |
| series2 | Addison-Wesley series in computer science and information processing |
| spelling | Hennie, Fred Verfasser aut Introduction to computability Reading, Mass. u.a. Addison-Wesley 1977 IX, 374 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Addison-Wesley series in computer science and information processing Algorithmes Fonctions calculables Fonctions récursives Programmation (Informatique) calculabilité inriac décidabilité inriac fonction récursive inriac machine Turing inriac Algorithms Computational complexity Recursive functions Turing machines Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Rekursivität (DE-588)4443996-9 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 s DE-604 Rekursivität (DE-588)4443996-9 s Berechenbarkeit (DE-588)4138368-0 s |
| spellingShingle | Hennie, Fred Introduction to computability Algorithmes Fonctions calculables Fonctions récursives Programmation (Informatique) calculabilité inriac décidabilité inriac fonction récursive inriac machine Turing inriac Algorithms Computational complexity Recursive functions Turing machines Berechenbarkeit (DE-588)4138368-0 gnd Rekursivität (DE-588)4443996-9 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4443996-9 (DE-588)4203525-9 |
| title | Introduction to computability |
| title_auth | Introduction to computability |
| title_exact_search | Introduction to computability |
| title_full | Introduction to computability |
| title_fullStr | Introduction to computability |
| title_full_unstemmed | Introduction to computability |
| title_short | Introduction to computability |
| title_sort | introduction to computability |
| topic | Algorithmes Fonctions calculables Fonctions récursives Programmation (Informatique) calculabilité inriac décidabilité inriac fonction récursive inriac machine Turing inriac Algorithms Computational complexity Recursive functions Turing machines Berechenbarkeit (DE-588)4138368-0 gnd Rekursivität (DE-588)4443996-9 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| topic_facet | Algorithmes Fonctions calculables Fonctions récursives Programmation (Informatique) calculabilité décidabilité fonction récursive machine Turing Algorithms Computational complexity Recursive functions Turing machines Berechenbarkeit Rekursivität Turing-Maschine |
| work_keys_str_mv | AT henniefred introductiontocomputability |