Super recursive algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer
2005
|
| Schriftenreihe: | Monographs in computer science
|
| Schlagworte: | |
| Beschreibung: | XII, 304 S. graph. Darst. |
| ISBN: | 0387955690 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV017983117 | ||
| 003 | DE-604 | ||
| 005 | 20060908 | ||
| 007 | t | ||
| 008 | 040405s2005 d||| |||| 00||| eng d | ||
| 020 | |a 0387955690 |9 0-387-95569-0 | ||
| 035 | |a (OCoLC)53871347 | ||
| 035 | |a (DE-599)BVBBV017983117 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-91G | ||
| 050 | 0 | |a QA9.615 | |
| 082 | 0 | |a 511.3/52 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 530f |2 stub | ||
| 100 | 1 | |a Burgin, Mark S. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Super recursive algorithms |c Mark Burgin |
| 246 | 1 | 3 | |a Super-recursive algorithms |
| 264 | 1 | |a New York, NY |b Springer |c 2005 | |
| 300 | |a XII, 304 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Monographs in computer science | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Automatentheorie |2 gtt | |
| 650 | 7 | |a Berekenbaarheid |2 gtt | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 7 | |a Recursie |2 gtt | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Recursive functions | |
| 650 | 0 | 7 | |a Rekursiver Algorithmus |0 (DE-588)4502357-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rekursiver Algorithmus |0 (DE-588)4502357-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010774259 | ||
Datensatz im Suchindex
| _version_ | 1804130614893346816 |
|---|---|
| any_adam_object | |
| author | Burgin, Mark S. |
| author_facet | Burgin, Mark S. |
| author_role | aut |
| author_sort | Burgin, Mark S. |
| author_variant | m s b ms msb |
| building | Verbundindex |
| bvnumber | BV017983117 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.615 |
| callnumber-search | QA9.615 |
| callnumber-sort | QA 19.615 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)53871347 (DE-599)BVBBV017983117 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| 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>01355nam a2200457 c 4500</leader><controlfield tag="001">BV017983117</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060908 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">040405s2005 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387955690</subfield><subfield code="9">0-387-95569-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)53871347</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017983117</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.615</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">22</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">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Burgin, Mark S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Super recursive algorithms</subfield><subfield code="c">Mark Burgin</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Super-recursive algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 304 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">Monographs in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berekenbaarheid</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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">Rekursiver Algorithmus</subfield><subfield code="0">(DE-588)4502357-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rekursiver Algorithmus</subfield><subfield code="0">(DE-588)4502357-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010774259</subfield></datafield></record></collection> |
| id | DE-604.BV017983117 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:23:50Z |
| institution | BVB |
| isbn | 0387955690 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010774259 |
| oclc_num | 53871347 |
| open_access_boolean | |
| owner | DE-703 DE-91G DE-BY-TUM |
| owner_facet | DE-703 DE-91G DE-BY-TUM |
| physical | XII, 304 S. graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| series2 | Monographs in computer science |
| spelling | Burgin, Mark S. Verfasser aut Super recursive algorithms Mark Burgin Super-recursive algorithms New York, NY Springer 2005 XII, 304 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Monographs in computer science Algoritmen gtt Automatentheorie gtt Berekenbaarheid gtt Complexiteit gtt Recursie gtt Algorithms Recursive functions Rekursiver Algorithmus (DE-588)4502357-8 gnd rswk-swf Rekursiver Algorithmus (DE-588)4502357-8 s DE-604 |
| spellingShingle | Burgin, Mark S. Super recursive algorithms Algoritmen gtt Automatentheorie gtt Berekenbaarheid gtt Complexiteit gtt Recursie gtt Algorithms Recursive functions Rekursiver Algorithmus (DE-588)4502357-8 gnd |
| subject_GND | (DE-588)4502357-8 |
| title | Super recursive algorithms |
| title_alt | Super-recursive algorithms |
| title_auth | Super recursive algorithms |
| title_exact_search | Super recursive algorithms |
| title_full | Super recursive algorithms Mark Burgin |
| title_fullStr | Super recursive algorithms Mark Burgin |
| title_full_unstemmed | Super recursive algorithms Mark Burgin |
| title_short | Super recursive algorithms |
| title_sort | super recursive algorithms |
| topic | Algoritmen gtt Automatentheorie gtt Berekenbaarheid gtt Complexiteit gtt Recursie gtt Algorithms Recursive functions Rekursiver Algorithmus (DE-588)4502357-8 gnd |
| topic_facet | Algoritmen Automatentheorie Berekenbaarheid Complexiteit Recursie Algorithms Recursive functions Rekursiver Algorithmus |
| work_keys_str_mv | AT burginmarks superrecursivealgorithms |