Algorithms for Constructing Computably Enumerable Sets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer International Publishing
2023
Cham Birkhäuser |
| Ausgabe: | 1st ed. 2023 |
| Schriftenreihe: | Computer Science Foundations and Applied Logic
|
| Schlagworte: | |
| Online-Zugang: | BFB01 BTU01 FCO01 FHA01 FHD01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FNU01 FRO01 FWS01 FWS02 HTW01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UEI01 UER01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource (XIV, 183 p. 46 illus., 4 illus. in color) |
| ISBN: | 9783031269042 |
| ISSN: | 2731-5762 |
| DOI: | 10.1007/978-3-031-26904-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV048982848 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 230601s2023 |||| o||u| ||||||eng d | ||
| 020 | |a 9783031269042 |c Online |9 978-3-031-26904-2 | ||
| 024 | 7 | |a 10.1007/978-3-031-26904-2 |2 doi | |
| 035 | |a (ZDB-2-SCS)9783031269042 | ||
| 035 | |a (OCoLC)1381299357 | ||
| 035 | |a (DE-599)BVBBV048982848 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-860 |a DE-19 |a DE-858 |a DE-Aug4 |a DE-898 |a DE-861 |a DE-188 |a DE-523 |a DE-1049 |a DE-859 |a DE-473 |a DE-29 |a DE-863 |a DE-1050 |a DE-20 |a DE-862 |a DE-92 |a DE-355 |a DE-824 |a DE-522 |a DE-384 |a DE-M347 |a DE-573 |a DE-703 |a DE-706 |a DE-739 |a DE-634 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a DAT 000 |2 stub | ||
| 100 | 1 | |a Supowit, Kenneth J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for Constructing Computably Enumerable Sets |c by Kenneth J. Supowit |
| 250 | |a 1st ed. 2023 | ||
| 264 | 1 | |a Cham |b Springer International Publishing |c 2023 | |
| 264 | 1 | |a Cham |b Birkhäuser | |
| 300 | |a 1 Online-Ressource (XIV, 183 p. 46 illus., 4 illus. in color) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Computer Science Foundations and Applied Logic |x 2731-5762 | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Computability and Recursion Theory | |
| 650 | 4 | |a Set Theory | |
| 650 | 4 | |a Theory and Algorithms for Application Domains | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Recursion theory | |
| 650 | 4 | |a Set theory | |
| 650 | 4 | |a Computer science—Mathematics | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-26903-5 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-26905-9 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-26906-6 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-26904-2 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2023 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034246305 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l BFB01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l BTU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FCO01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHD01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHI01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHN01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FHR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FKE01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FLA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FNU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FRO01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FWS01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l FWS02 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l HTW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBT01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UEI01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UER01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-26904-2 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| DE-BY-FWS_katkey | 1043823 |
|---|---|
| _version_ | 1806175243879841792 |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Supowit, Kenneth J. |
| author_facet | Supowit, Kenneth J. |
| author_role | aut |
| author_sort | Supowit, Kenneth J. |
| author_variant | k j s kj kjs |
| building | Verbundindex |
| bvnumber | BV048982848 |
| classification_tum | DAT 000 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)9783031269042 (OCoLC)1381299357 (DE-599)BVBBV048982848 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-3-031-26904-2 |
| edition | 1st ed. 2023 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04517nmm a2200841zcb4500</leader><controlfield tag="001">BV048982848</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">230601s2023 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031269042</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-031-26904-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-031-26904-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783031269042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1381299357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048982848</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-860</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Supowit, Kenneth J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for Constructing Computably Enumerable Sets</subfield><subfield code="c">by Kenneth J. Supowit</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2023</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer International Publishing</subfield><subfield code="c">2023</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Birkhäuser</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 183 p. 46 illus., 4 illus. in color)</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="490" ind1="0" ind2=" "><subfield code="a">Computer Science Foundations and Applied Logic</subfield><subfield code="x">2731-5762</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computability and Recursion Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory and Algorithms for Application Domains</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-031-26903-5</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-031-26905-9</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-031-26906-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2023</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034246305</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">BFB01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FCO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHD01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FNU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UEI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-26904-2</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048982848 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T22:05:26Z |
| indexdate | 2024-08-01T11:02:20Z |
| institution | BVB |
| isbn | 9783031269042 |
| issn | 2731-5762 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034246305 |
| oclc_num | 1381299357 |
| open_access_boolean | |
| owner | DE-860 DE-19 DE-BY-UBM DE-858 DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-188 DE-523 DE-1049 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-522 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634 |
| owner_facet | DE-860 DE-19 DE-BY-UBM DE-858 DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-188 DE-523 DE-1049 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-522 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634 |
| physical | 1 Online-Ressource (XIV, 183 p. 46 illus., 4 illus. in color) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2023 |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer International Publishing Birkhäuser |
| record_format | marc |
| series2 | Computer Science Foundations and Applied Logic |
| spellingShingle | Supowit, Kenneth J. Algorithms for Constructing Computably Enumerable Sets Theory of Computation Computability and Recursion Theory Set Theory Theory and Algorithms for Application Domains Mathematics of Computing Computer science Computable functions Recursion theory Set theory Computer science—Mathematics |
| title | Algorithms for Constructing Computably Enumerable Sets |
| title_auth | Algorithms for Constructing Computably Enumerable Sets |
| title_exact_search | Algorithms for Constructing Computably Enumerable Sets |
| title_exact_search_txtP | Algorithms for Constructing Computably Enumerable Sets |
| title_full | Algorithms for Constructing Computably Enumerable Sets by Kenneth J. Supowit |
| title_fullStr | Algorithms for Constructing Computably Enumerable Sets by Kenneth J. Supowit |
| title_full_unstemmed | Algorithms for Constructing Computably Enumerable Sets by Kenneth J. Supowit |
| title_short | Algorithms for Constructing Computably Enumerable Sets |
| title_sort | algorithms for constructing computably enumerable sets |
| topic | Theory of Computation Computability and Recursion Theory Set Theory Theory and Algorithms for Application Domains Mathematics of Computing Computer science Computable functions Recursion theory Set theory Computer science—Mathematics |
| topic_facet | Theory of Computation Computability and Recursion Theory Set Theory Theory and Algorithms for Application Domains Mathematics of Computing Computer science Computable functions Recursion theory Set theory Computer science—Mathematics |
| url | https://doi.org/10.1007/978-3-031-26904-2 |
| work_keys_str_mv | AT supowitkennethj algorithmsforconstructingcomputablyenumerablesets |