Theory of computation:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New York [u.a.]
Wiley
1974
|
Schriftenreihe: | A Wiley-Interscience publication
|
Schlagworte: | |
Beschreibung: | XXI, 336 S. |
ISBN: | 0471095850 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV002625210 | ||
003 | DE-604 | ||
005 | 20100521 | ||
007 | t | ||
008 | 900403s1974 |||| 00||| eng d | ||
020 | |a 0471095850 |9 0-471-09585-0 | ||
035 | |a (OCoLC)694056 | ||
035 | |a (DE-599)BVBBV002625210 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G |a DE-384 |a DE-739 |a DE-355 |a DE-20 |a DE-29T |a DE-19 |a DE-83 |a DE-12 |a DE-706 |a DE-188 | ||
050 | 0 | |a QA267.5.S4 | |
082 | 0 | |a 519.4 |2 19 | |
084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
100 | 1 | |a Brainerd, Walter S. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Theory of computation |c Walter S. Brainerd ; Lawrence H. Landweber |
264 | 1 | |a New York [u.a.] |b Wiley |c 1974 | |
300 | |a XXI, 336 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a A Wiley-Interscience publication | |
650 | 4 | |a Fonctions récursives | |
650 | 7 | |a Fonctions récursives |2 ram | |
650 | 7 | |a Langages de 4e génération |2 ram | |
650 | 4 | |a Langages de programmation | |
650 | 4 | |a Machines séquentielles (Théorie) | |
650 | 7 | |a Machines séquentielles, Théorie des |2 ram | |
650 | 7 | |a complexité calcul |2 inriac | |
650 | 7 | |a fonction récursive |2 inriac | |
650 | 7 | |a langage algorithmique |2 inriac | |
650 | 7 | |a langage formel |2 inriac | |
650 | 7 | |a langage machine |2 inriac | |
650 | 7 | |a théorie calcul |2 inriac | |
650 | 4 | |a Programming languages (Electronic computers) | |
650 | 4 | |a Recursive functions | |
650 | 4 | |a Sequential machine theory | |
650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
689 | 3 | |5 DE-604 | |
700 | 1 | |a Landweber, Lawrence H. |e Verfasser |4 aut | |
999 | |a oai:aleph.bib-bvb.de:BVB01-001686979 | ||
980 | 4 | |a (DE-12)AK2990174 | |
980 | 4 | |a (DE-12)AK12750646 |
Datensatz im Suchindex
_version_ | 1804117009288396800 |
---|---|
any_adam_object | |
author | Brainerd, Walter S. Landweber, Lawrence H. |
author_facet | Brainerd, Walter S. Landweber, Lawrence H. |
author_role | aut aut |
author_sort | Brainerd, Walter S. |
author_variant | w s b ws wsb l h l lh lhl |
building | Verbundindex |
bvnumber | BV002625210 |
callnumber-first | Q - Science |
callnumber-label | QA267 |
callnumber-raw | QA267.5.S4 |
callnumber-search | QA267.5.S4 |
callnumber-sort | QA 3267.5 S4 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 120 ST 130 |
ctrlnum | (OCoLC)694056 (DE-599)BVBBV002625210 |
dewey-full | 519.4 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.4 |
dewey-search | 519.4 |
dewey-sort | 3519.4 |
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>02343nam a2200673 c 4500</leader><controlfield tag="001">BV002625210</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100521 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900403s1974 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471095850</subfield><subfield code="9">0-471-09585-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)694056</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002625210</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-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.5.S4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</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="100" ind1="1" ind2=" "><subfield code="a">Brainerd, Walter S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of computation</subfield><subfield code="c">Walter S. Brainerd ; Lawrence H. Landweber</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Wiley</subfield><subfield code="c">1974</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXI, 336 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="490" ind1="0" ind2=" "><subfield code="a">A Wiley-Interscience publication</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="7"><subfield code="a">Langages de 4e génération</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages de programmation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machines séquentielles (Théorie)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machines séquentielles, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité 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">langage algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage machine</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie calcul</subfield><subfield code="2">inriac</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=" " ind2="4"><subfield code="a">Sequential machine theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Landweber, Lawrence H.</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-001686979</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK2990174</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK12750646</subfield></datafield></record></collection> |
id | DE-604.BV002625210 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T15:47:35Z |
institution | BVB |
isbn | 0471095850 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001686979 |
oclc_num | 694056 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-19 DE-BY-UBM DE-83 DE-12 DE-706 DE-188 |
owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-19 DE-BY-UBM DE-83 DE-12 DE-706 DE-188 |
physical | XXI, 336 S. |
publishDate | 1974 |
publishDateSearch | 1974 |
publishDateSort | 1974 |
publisher | Wiley |
record_format | marc |
series2 | A Wiley-Interscience publication |
spelling | Brainerd, Walter S. Verfasser aut Theory of computation Walter S. Brainerd ; Lawrence H. Landweber New York [u.a.] Wiley 1974 XXI, 336 S. txt rdacontent n rdamedia nc rdacarrier A Wiley-Interscience publication Fonctions récursives Fonctions récursives ram Langages de 4e génération ram Langages de programmation Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram complexité calcul inriac fonction récursive inriac langage algorithmique inriac langage formel inriac langage machine inriac théorie calcul inriac Programming languages (Electronic computers) Recursive functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Formale Sprache (DE-588)4017848-1 s DE-604 Automatentheorie (DE-588)4003953-5 s Informatik (DE-588)4026894-9 s Programmiersprache (DE-588)4047409-4 s Landweber, Lawrence H. Verfasser aut |
spellingShingle | Brainerd, Walter S. Landweber, Lawrence H. Theory of computation Fonctions récursives Fonctions récursives ram Langages de 4e génération ram Langages de programmation Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram complexité calcul inriac fonction récursive inriac langage algorithmique inriac langage formel inriac langage machine inriac théorie calcul inriac Programming languages (Electronic computers) Recursive functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd Programmiersprache (DE-588)4047409-4 gnd Informatik (DE-588)4026894-9 gnd |
subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 (DE-588)4047409-4 (DE-588)4026894-9 |
title | Theory of computation |
title_auth | Theory of computation |
title_exact_search | Theory of computation |
title_full | Theory of computation Walter S. Brainerd ; Lawrence H. Landweber |
title_fullStr | Theory of computation Walter S. Brainerd ; Lawrence H. Landweber |
title_full_unstemmed | Theory of computation Walter S. Brainerd ; Lawrence H. Landweber |
title_short | Theory of computation |
title_sort | theory of computation |
topic | Fonctions récursives Fonctions récursives ram Langages de 4e génération ram Langages de programmation Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram complexité calcul inriac fonction récursive inriac langage algorithmique inriac langage formel inriac langage machine inriac théorie calcul inriac Programming languages (Electronic computers) Recursive functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd Programmiersprache (DE-588)4047409-4 gnd Informatik (DE-588)4026894-9 gnd |
topic_facet | Fonctions récursives Langages de 4e génération Langages de programmation Machines séquentielles (Théorie) Machines séquentielles, Théorie des complexité calcul fonction récursive langage algorithmique langage formel langage machine théorie calcul Programming languages (Electronic computers) Recursive functions Sequential machine theory Automatentheorie Formale Sprache Programmiersprache Informatik |
work_keys_str_mv | AT brainerdwalters theoryofcomputation AT landweberlawrenceh theoryofcomputation |