Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Kent
Elsevier Science
2014
|
| Subjects: | |
| Online Access: | FAW01 |
| Summary: | Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students |
| Item Description: | Description based on publisher supplied metadata and other sources |
| Physical Description: | 1 online resource (448 pages) |
| ISBN: | 9781483264585 9780122063800 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043616725 | ||
| 003 | DE-604 | ||
| 005 | 20180302 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160616s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9781483264585 |9 978-1-4832-6458-5 | ||
| 020 | |a 9780122063800 |c Print |9 978-0-12-206380-0 | ||
| 035 | |a (ZDB-30-PQE)EBC1901552 | ||
| 035 | |a (ZDB-89-EBL)EBL1901552 | ||
| 035 | |a (ZDB-38-EBR)ebr11008623 | ||
| 035 | |a (OCoLC)644355044 | ||
| 035 | |a (DE-599)BVBBV043616725 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511.3 | |
| 100 | 1 | |a Davis, Martin |d 1928-2023 |e Verfasser |0 (DE-588)116040866 |4 aut | |
| 245 | 1 | 0 | |a Computability, Complexity, and Languages |b Fundamentals of Theoretical Computer Science |
| 264 | 1 | |a Kent |b Elsevier Science |c 2014 | |
| 264 | 4 | |c © 1983 | |
| 300 | |a 1 online resource (448 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | |a Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 689 | 4 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 4 | |8 5\p |5 DE-604 | |
| 700 | 1 | |a Weyuker, Elaine J. |e Sonstige |0 (DE-588)135877199 |4 oth | |
| 700 | 1 | |a Rheinboldt, Werner |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Davis, Martin D |t . Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science |
| 912 | |a ZDB-30-PQE |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029030784 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9780122063800 |l FAW01 |p ZDB-33-ESD |q FAW_PDA_ESD |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176358798000128 |
|---|---|
| any_adam_object | |
| author | Davis, Martin 1928-2023 |
| author_GND | (DE-588)116040866 (DE-588)135877199 |
| author_facet | Davis, Martin 1928-2023 |
| author_role | aut |
| author_sort | Davis, Martin 1928-2023 |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | BV043616725 |
| collection | ZDB-30-PQE ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-30-PQE)EBC1901552 (ZDB-89-EBL)EBL1901552 (ZDB-38-EBR)ebr11008623 (OCoLC)644355044 (DE-599)BVBBV043616725 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03962nmm a2200685zc 4500</leader><controlfield tag="001">BV043616725</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180302 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160616s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781483264585</subfield><subfield code="9">978-1-4832-6458-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780122063800</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-12-206380-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC1901552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1901552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr11008623</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)644355044</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043616725</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-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability, Complexity, and Languages</subfield><subfield code="b">Fundamentals of Theoretical Computer Science</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kent</subfield><subfield code="b">Elsevier Science</subfield><subfield code="c">2014</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (448 pages)</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 publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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">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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Weyuker, Elaine J.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)135877199</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rheinboldt, Werner</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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">Davis, Martin D</subfield><subfield code="t">. Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029030784</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780122063800</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043616725 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:30:55Z |
| institution | BVB |
| isbn | 9781483264585 9780122063800 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029030784 |
| oclc_num | 644355044 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 online resource (448 pages) |
| psigel | ZDB-30-PQE ZDB-33-ESD ZDB-33-EBS ZDB-33-ESD FAW_PDA_ESD |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Elsevier Science |
| record_format | marc |
| spelling | Davis, Martin 1928-2023 Verfasser (DE-588)116040866 aut Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science Kent Elsevier Science 2014 © 1983 1 online resource (448 pages) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students Computational complexity Formal languages Machine theory Formale Sprache (DE-588)4017848-1 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexität (DE-588)4135369-9 s 1\p DE-604 Berechenbarkeit (DE-588)4138368-0 s 2\p DE-604 Formale Sprache (DE-588)4017848-1 s 3\p DE-604 Automatentheorie (DE-588)4003953-5 s 4\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 5\p DE-604 Weyuker, Elaine J. Sonstige (DE-588)135877199 oth Rheinboldt, Werner Sonstige oth Erscheint auch als Druck-Ausgabe Davis, Martin D . Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Davis, Martin 1928-2023 Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science Computational complexity Formal languages Machine theory Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Komplexität (DE-588)4135369-9 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4138368-0 (DE-588)4135369-9 (DE-588)4003953-5 (DE-588)4196735-5 |
| title | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_auth | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_exact_search | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_full | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_fullStr | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_full_unstemmed | Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
| title_short | Computability, Complexity, and Languages |
| title_sort | computability complexity and languages fundamentals of theoretical computer science |
| title_sub | Fundamentals of Theoretical Computer Science |
| topic | Computational complexity Formal languages Machine theory Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Komplexität (DE-588)4135369-9 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Computational complexity Formal languages Machine theory Formale Sprache Berechenbarkeit Komplexität Automatentheorie Theoretische Informatik |
| work_keys_str_mv | AT davismartin computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT weyukerelainej computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT rheinboldtwerner computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience |