Enumerability, decidability, computability: an introduction to the theory of recursive functions
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Germany ; New York, New York
Springer-Verlag
[1965]
|
| Subjects: | |
| Online Access: | DE-Y3 |
| Item Description: | Description based on print version record |
| Physical Description: | 1 Online-Ressource (255 pages) illustrations |
| ISBN: | 9783662116869 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV049549292 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 240208s1965 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662116869 |9 978-3-662-11686-9 | ||
| 035 | |a (ZDB-30-PQE)EBC6555597 | ||
| 035 | |a (ZDB-30-PAD)EBC6555597 | ||
| 035 | |a (ZDB-89-EBL)EBL6555597 | ||
| 035 | |a (OCoLC)1255234479 | ||
| 035 | |a (DE-599)BVBBV049549292 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-Y3 | ||
| 082 | 0 | |a 164 |2 23 | |
| 100 | 1 | |a Hermes, Hans |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Enumerability, decidability, computability |b an introduction to the theory of recursive functions |c Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann |
| 264 | 1 | |a Berlin, Germany ; New York, New York |b Springer-Verlag |c [1965] | |
| 264 | 4 | |c 1965 | |
| 300 | |a 1 Online-Ressource (255 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on print version record | ||
| 650 | 4 | |a Mathematics | |
| 650 | 0 | 7 | |a Rekursive Funktion |0 (DE-588)4138367-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Aufzählbarkeit |0 (DE-588)4800450-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-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 Aufzählbarkeit |0 (DE-588)4800450-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Rekursive Funktion |0 (DE-588)4138367-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 5 | |5 DE-604 | |
| 700 | 1 | |a Herman, Gabor T. |4 trl | |
| 700 | 1 | |a Plassmann, Ortwin |4 trl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Hermes, Hans |t Enumerability, decidability, computability : an introduction to the theory of recursive functions |d Berlin, Germany ; New York, New York : Springer-Verlag, c1965 |h 255 pages |z 9783662116883 |
| 912 | |a ZDB-30-PAD | ||
| 940 | 1 | |q KUBA1-ZDB-30-PAD-2023 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/khifiit/detail.action?docID=6555597 |l DE-Y3 |p ZDB-30-PAD |q KHI |x Aggregator |3 Volltext | |
Record in the Search Index
| _version_ | 1805069643466932224 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Hermes, Hans |
| author2 | Herman, Gabor T. Plassmann, Ortwin |
| author2_role | trl trl |
| author2_variant | g t h gt gth o p op |
| author_facet | Hermes, Hans Herman, Gabor T. Plassmann, Ortwin |
| author_role | aut |
| author_sort | Hermes, Hans |
| author_variant | h h hh |
| building | Verbundindex |
| bvnumber | BV049549292 |
| collection | ZDB-30-PAD |
| ctrlnum | (ZDB-30-PQE)EBC6555597 (ZDB-30-PAD)EBC6555597 (ZDB-89-EBL)EBL6555597 (OCoLC)1255234479 (DE-599)BVBBV049549292 |
| dewey-full | 164 |
| dewey-hundreds | 100 - Philosophy & psychology |
| dewey-ones | 164 - [Unassigned] |
| dewey-raw | 164 |
| dewey-search | 164 |
| dewey-sort | 3164 |
| dewey-tens | 160 - Philosophical logic |
| discipline | Philosophie |
| discipline_str_mv | Philosophie |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000zc 4500</leader><controlfield tag="001">BV049549292</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">240208s1965 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662116869</subfield><subfield code="9">978-3-662-11686-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC6555597</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC6555597</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL6555597</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1255234479</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049549292</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-Y3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">164</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hermes, Hans</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Enumerability, decidability, computability</subfield><subfield code="b">an introduction to the theory of recursive functions</subfield><subfield code="c">Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Germany ; New York, New York</subfield><subfield code="b">Springer-Verlag</subfield><subfield code="c">[1965]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">1965</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (255 pages)</subfield><subfield code="b">illustrations</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on print version record</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-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="650" ind1="0" ind2="7"><subfield code="a">Aufzählbarkeit</subfield><subfield code="0">(DE-588)4800450-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</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=" "><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">Aufzählbarkeit</subfield><subfield code="0">(DE-588)4800450-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Herman, Gabor T.</subfield><subfield code="4">trl</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plassmann, Ortwin</subfield><subfield code="4">trl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Hermes, Hans</subfield><subfield code="t">Enumerability, decidability, computability : an introduction to the theory of recursive functions</subfield><subfield code="d">Berlin, Germany ; New York, New York : Springer-Verlag, c1965</subfield><subfield code="h">255 pages</subfield><subfield code="z">9783662116883</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">KUBA1-ZDB-30-PAD-2023</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/khifiit/detail.action?docID=6555597</subfield><subfield code="l">DE-Y3</subfield><subfield code="p">ZDB-30-PAD</subfield><subfield code="q">KHI</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV049549292 |
| illustrated | Illustrated |
| index_date | 2024-07-03T23:28:17Z |
| indexdate | 2024-07-20T04:09:18Z |
| institution | BVB |
| isbn | 9783662116869 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034894746 |
| oclc_num | 1255234479 |
| open_access_boolean | |
| owner | DE-Y3 |
| owner_facet | DE-Y3 |
| physical | 1 Online-Ressource (255 pages) illustrations |
| psigel | ZDB-30-PAD KUBA1-ZDB-30-PAD-2023 ZDB-30-PAD KHI |
| publishDate | 1965 |
| publishDateSearch | 1965 |
| publishDateSort | 1965 |
| publisher | Springer-Verlag |
| record_format | marc |
| spelling | Hermes, Hans Verfasser aut Enumerability, decidability, computability an introduction to the theory of recursive functions Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann Berlin, Germany ; New York, New York Springer-Verlag [1965] 1965 1 Online-Ressource (255 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Description based on print version record Mathematics Rekursive Funktion (DE-588)4138367-9 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Aufzählbarkeit (DE-588)4800450-9 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 s DE-604 Algorithmus (DE-588)4001183-5 s Berechenbarkeit (DE-588)4138368-0 s Aufzählbarkeit (DE-588)4800450-9 s Rekursive Funktion (DE-588)4138367-9 s Algorithmentheorie (DE-588)4200409-3 s Herman, Gabor T. trl Plassmann, Ortwin trl Erscheint auch als Druck-Ausgabe Hermes, Hans Enumerability, decidability, computability : an introduction to the theory of recursive functions Berlin, Germany ; New York, New York : Springer-Verlag, c1965 255 pages 9783662116883 |
| spellingShingle | Hermes, Hans Enumerability, decidability, computability an introduction to the theory of recursive functions Mathematics Rekursive Funktion (DE-588)4138367-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd Aufzählbarkeit (DE-588)4800450-9 gnd Entscheidbarkeit (DE-588)4152398-2 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4138367-9 (DE-588)4138368-0 (DE-588)4800450-9 (DE-588)4152398-2 (DE-588)4200409-3 (DE-588)4001183-5 |
| title | Enumerability, decidability, computability an introduction to the theory of recursive functions |
| title_auth | Enumerability, decidability, computability an introduction to the theory of recursive functions |
| title_exact_search | Enumerability, decidability, computability an introduction to the theory of recursive functions |
| title_exact_search_txtP | Enumerability, decidability, computability an introduction to the theory of recursive functions |
| title_full | Enumerability, decidability, computability an introduction to the theory of recursive functions Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann |
| title_fullStr | Enumerability, decidability, computability an introduction to the theory of recursive functions Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann |
| title_full_unstemmed | Enumerability, decidability, computability an introduction to the theory of recursive functions Hans Hermes ; Translated by Gabor T. Herman and O. Plassmann |
| title_short | Enumerability, decidability, computability |
| title_sort | enumerability decidability computability an introduction to the theory of recursive functions |
| title_sub | an introduction to the theory of recursive functions |
| topic | Mathematics Rekursive Funktion (DE-588)4138367-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd Aufzählbarkeit (DE-588)4800450-9 gnd Entscheidbarkeit (DE-588)4152398-2 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Mathematics Rekursive Funktion Berechenbarkeit Aufzählbarkeit Entscheidbarkeit Algorithmentheorie Algorithmus |
| work_keys_str_mv | AT hermeshans enumerabilitydecidabilitycomputabilityanintroductiontothetheoryofrecursivefunctions AT hermangabort enumerabilitydecidabilitycomputabilityanintroductiontothetheoryofrecursivefunctions AT plassmannortwin enumerabilitydecidabilitycomputabilityanintroductiontothetheoryofrecursivefunctions |