Computable Analysis: An Introduction
Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2000
|
| Ausgabe: | 1st ed. 2000 |
| Schriftenreihe: | Texts in Theoretical Computer Science. An EATCS Series
|
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text |
| Beschreibung: | 1 Online-Ressource (X, 288 p) |
| ISBN: | 9783642569999 |
| DOI: | 10.1007/978-3-642-56999-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064888 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642569999 |9 978-3-642-56999-9 | ||
| 024 | 7 | |a 10.1007/978-3-642-56999-9 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-642-56999-9 | ||
| 035 | |a (OCoLC)1227484290 | ||
| 035 | |a (DE-599)BVBBV047064888 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.11 |2 23 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 490 |0 (DE-625)143242: |2 rvk | ||
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 100 | 1 | |a Weihrauch, Klaus |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computable Analysis |b An Introduction |c by Klaus Weihrauch |
| 250 | |a 1st ed. 2000 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2000 | |
| 300 | |a 1 Online-Ressource (X, 288 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts in Theoretical Computer Science. An EATCS Series | |
| 520 | |a Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text | ||
| 650 | 4 | |a Programming Techniques | |
| 650 | 4 | |a Analysis | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Mathematical analysis | |
| 650 | 4 | |a Analysis (Mathematics) | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 0 | 7 | |a Analysis |0 (DE-588)4001865-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Analysis |0 (DE-588)4001865-9 |D s |
| 689 | 0 | 1 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642631023 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642570001 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540668176 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-56999-9 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032472000 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-56999-9 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182063499182080 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Weihrauch, Klaus |
| author_facet | Weihrauch, Klaus |
| author_role | aut |
| author_sort | Weihrauch, Klaus |
| author_variant | k w kw |
| building | Verbundindex |
| bvnumber | BV047064888 |
| classification_rvk | SK 130 SK 490 ST 120 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-642-56999-9 (OCoLC)1227484290 (DE-599)BVBBV047064888 |
| dewey-full | 005.11 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.11 |
| dewey-search | 005.11 |
| dewey-sort | 15.11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/978-3-642-56999-9 |
| edition | 1st ed. 2000 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03299nmm a2200649zc 4500</leader><controlfield tag="001">BV047064888</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642569999</subfield><subfield code="9">978-3-642-56999-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-56999-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-642-56999-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227484290</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064888</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.11</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 490</subfield><subfield code="0">(DE-625)143242:</subfield><subfield code="2">rvk</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="100" ind1="1" ind2=" "><subfield code="a">Weihrauch, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computable Analysis</subfield><subfield code="b">An Introduction</subfield><subfield code="c">by Klaus Weihrauch</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 288 p)</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">Texts in Theoretical Computer Science. An EATCS Series</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis</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">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Analysis</subfield><subfield code="0">(DE-588)4001865-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="689" ind1="0" ind2="0"><subfield code="a">Analysis</subfield><subfield code="0">(DE-588)4001865-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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">9783642631023</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">9783642570001</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">9783540668176</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-56999-9</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstverö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_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032472000</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-56999-9</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064888 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:36Z |
| institution | BVB |
| isbn | 9783642569999 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032472000 |
| oclc_num | 1227484290 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (X, 288 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Texts in Theoretical Computer Science. An EATCS Series |
| spelling | Weihrauch, Klaus Verfasser aut Computable Analysis An Introduction by Klaus Weihrauch 1st ed. 2000 Berlin, Heidelberg Springer Berlin Heidelberg 2000 1 Online-Ressource (X, 288 p) txt rdacontent c rdamedia cr rdacarrier Texts in Theoretical Computer Science. An EATCS Series Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text Programming Techniques Analysis Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computer programming Mathematical analysis Analysis (Mathematics) Computers Algorithms Mathematical logic Analysis (DE-588)4001865-9 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Analysis (DE-588)4001865-9 s Berechenbarkeit (DE-588)4138368-0 s DE-604 Erscheint auch als Druck-Ausgabe 9783642631023 Erscheint auch als Druck-Ausgabe 9783642570001 Erscheint auch als Druck-Ausgabe 9783540668176 https://doi.org/10.1007/978-3-642-56999-9 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Weihrauch, Klaus Computable Analysis An Introduction Programming Techniques Analysis Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computer programming Mathematical analysis Analysis (Mathematics) Computers Algorithms Mathematical logic Analysis (DE-588)4001865-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4001865-9 (DE-588)4138368-0 |
| title | Computable Analysis An Introduction |
| title_auth | Computable Analysis An Introduction |
| title_exact_search | Computable Analysis An Introduction |
| title_exact_search_txtP | Computable Analysis An Introduction |
| title_full | Computable Analysis An Introduction by Klaus Weihrauch |
| title_fullStr | Computable Analysis An Introduction by Klaus Weihrauch |
| title_full_unstemmed | Computable Analysis An Introduction by Klaus Weihrauch |
| title_short | Computable Analysis |
| title_sort | computable analysis an introduction |
| title_sub | An Introduction |
| topic | Programming Techniques Analysis Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computer programming Mathematical analysis Analysis (Mathematics) Computers Algorithms Mathematical logic Analysis (DE-588)4001865-9 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Programming Techniques Analysis Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computer programming Mathematical analysis Analysis (Mathematics) Computers Algorithms Mathematical logic Berechenbarkeit |
| url | https://doi.org/10.1007/978-3-642-56999-9 |
| work_keys_str_mv | AT weihrauchklaus computableanalysisanintroduction |