Algorithms for Constructing Computably Enumerable Sets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer International Publishing
2023
Cham Birkhäuser |
| Ausgabe: | 1st ed. 2023 |
| Schriftenreihe: | Computer Science Foundations and Applied Logic
|
| Schlagworte: | |
| Beschreibung: | XIV, 183 p. 46 illus., 4 illus. in color |
| ISBN: | 9783031269042 |
| ISSN: | 2731-5762 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV049747822 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 240619s2023 |||| 00||| eng d | ||
| 020 | |a 9783031269042 |c Online |9 978-3-031-26904-2 | ||
| 035 | |a (DE-599)BVBBV049747822 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 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 XIV, 183 p. 46 illus., 4 illus. in color | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |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 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-031-26904-2 |
Datensatz im Suchindex
| _version_ | 1805077884702818304 |
|---|---|
| adam_text | |
| any_adam_object | |
| 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 | BV049747822 |
| classification_tum | DAT 000 |
| ctrlnum | (DE-599)BVBBV049747822 |
| 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 |
| edition | 1st ed. 2023 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV049747822</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240619s2023 |||| 00||| 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="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049747822</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="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">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">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">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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-031-26904-2</subfield></datafield></record></collection> |
| id | DE-604.BV049747822 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-20T06:20:17Z |
| institution | BVB |
| isbn | 9783031269042 |
| issn | 2731-5762 |
| language | English |
| open_access_boolean | |
| physical | XIV, 183 p. 46 illus., 4 illus. in color |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer International Publishing Birkhäuser |
| record_format | marc |
| series2 | Computer Science Foundations and Applied Logic |
| spelling | Supowit, Kenneth J. Verfasser aut Algorithms for Constructing Computably Enumerable Sets by Kenneth J. Supowit 1st ed. 2023 Cham Springer International Publishing 2023 Cham Birkhäuser XIV, 183 p. 46 illus., 4 illus. in color txt rdacontent n rdamedia nc rdacarrier Computer Science Foundations and Applied Logic 2731-5762 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 Erscheint auch als Druck-Ausgabe 978-3-031-26903-5 Erscheint auch als Druck-Ausgabe 978-3-031-26905-9 Erscheint auch als Druck-Ausgabe 978-3-031-26906-6 Erscheint auch als Online-Ausgabe 978-3-031-26904-2 |
| 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_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 |
| work_keys_str_mv | AT supowitkennethj algorithmsforconstructingcomputablyenumerablesets |