An introduction to the general theory of algorithms:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
North-Holland
1978
|
| Schriftenreihe: | Theory of computation series
|
| Schlagworte: | |
| Beschreibung: | VII, 264 S. Ill. |
| ISBN: | 044400226X 0444002278 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002282703 | ||
| 003 | DE-604 | ||
| 005 | 20090826 | ||
| 007 | t | ||
| 008 | 890928s1978 a||| |||| 00||| eng d | ||
| 020 | |a 044400226X |9 0-444-00226-X | ||
| 020 | |a 0444002278 |9 0-444-00227-8 | ||
| 035 | |a (OCoLC)3168554 | ||
| 035 | |a (DE-599)BVBBV002282703 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-29T |a DE-20 |a DE-19 |a DE-706 |a DE-634 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA76.7 | |
| 082 | 0 | |a 511/.8 |2 18 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 68C05 |2 msc | ||
| 100 | 1 | |a Machtey, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An introduction to the general theory of algorithms |c Michael Machtey ; Paul Young |
| 264 | 1 | |a New York [u.a.] |b North-Holland |c 1978 | |
| 300 | |a VII, 264 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Theory of computation series | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 4 | |a Fonctions récursives | |
| 650 | 4 | |a Langages de programmation | |
| 650 | 7 | |a Software |2 gtt | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 4 | |a Recursive functions | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |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 Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 3 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Young, Paul |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001500204 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804116741841747968 |
|---|---|
| any_adam_object | |
| author | Machtey, Michael Young, Paul |
| author_facet | Machtey, Michael Young, Paul |
| author_role | aut aut |
| author_sort | Machtey, Michael |
| author_variant | m m mm p y py |
| building | Verbundindex |
| bvnumber | BV002282703 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.7 |
| callnumber-search | QA76.7 |
| callnumber-sort | QA 276.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 |
| ctrlnum | (OCoLC)3168554 (DE-599)BVBBV002282703 |
| dewey-full | 511/.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.8 |
| dewey-search | 511/.8 |
| dewey-sort | 3511 18 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02187nam a2200625 c 4500</leader><controlfield tag="001">BV002282703</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090826 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1978 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">044400226X</subfield><subfield code="9">0-444-00226-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444002278</subfield><subfield code="9">0-444-00227-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)3168554</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002282703</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-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.8</subfield><subfield code="2">18</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">68C05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Machtey, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An introduction to the general theory of algorithms</subfield><subfield code="c">Michael Machtey ; Paul Young</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">North-Holland</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 264 S.</subfield><subfield code="b">Ill.</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">Theory of computation series</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</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">Langages de programmation</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Software</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</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="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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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="689" ind1="3" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Young, Paul</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001500204</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.BV002282703 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:43:20Z |
| institution | BVB |
| isbn | 044400226X 0444002278 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001500204 |
| oclc_num | 3168554 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-188 |
| physical | VII, 264 S. Ill. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| publisher | North-Holland |
| record_format | marc |
| series2 | Theory of computation series |
| spelling | Machtey, Michael Verfasser aut An introduction to the general theory of algorithms Michael Machtey ; Paul Young New York [u.a.] North-Holland 1978 VII, 264 S. Ill. txt rdacontent n rdamedia nc rdacarrier Theory of computation series Algorithmes Algoritmen gtt Fonctions récursives Langages de programmation Software gtt Computer algorithms Programming languages (Electronic computers) Recursive functions Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 s DE-604 Algorithmus (DE-588)4001183-5 s Programmierung (DE-588)4076370-5 s Berechenbarkeit (DE-588)4138368-0 s Algorithmentheorie (DE-588)4200409-3 s 1\p DE-604 Young, Paul Verfasser aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Machtey, Michael Young, Paul An introduction to the general theory of algorithms Algorithmes Algoritmen gtt Fonctions récursives Langages de programmation Software gtt Computer algorithms Programming languages (Electronic computers) Recursive functions Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4076370-5 (DE-588)4200409-3 (DE-588)4138368-0 (DE-588)4203525-9 |
| title | An introduction to the general theory of algorithms |
| title_auth | An introduction to the general theory of algorithms |
| title_exact_search | An introduction to the general theory of algorithms |
| title_full | An introduction to the general theory of algorithms Michael Machtey ; Paul Young |
| title_fullStr | An introduction to the general theory of algorithms Michael Machtey ; Paul Young |
| title_full_unstemmed | An introduction to the general theory of algorithms Michael Machtey ; Paul Young |
| title_short | An introduction to the general theory of algorithms |
| title_sort | an introduction to the general theory of algorithms |
| topic | Algorithmes Algoritmen gtt Fonctions récursives Langages de programmation Software gtt Computer algorithms Programming languages (Electronic computers) Recursive functions Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| topic_facet | Algorithmes Algoritmen Fonctions récursives Langages de programmation Software Computer algorithms Programming languages (Electronic computers) Recursive functions Algorithmus Programmierung Algorithmentheorie Berechenbarkeit Turing-Maschine |
| work_keys_str_mv | AT machteymichael anintroductiontothegeneraltheoryofalgorithms AT youngpaul anintroductiontothegeneraltheoryofalgorithms |