Computability: A Mathematical Sketchbook
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
New York, NY
Springer New York
1994
|
Schriftenreihe: | Graduate Texts in Mathematics
146 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included |
Beschreibung: | 1 Online-Ressource (XI, 180 p) |
ISBN: | 9781461208631 9781461269250 |
ISSN: | 0072-5285 |
DOI: | 10.1007/978-1-4612-0863-1 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV042419651 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s1994 |||| o||u| ||||||eng d | ||
020 | |a 9781461208631 |c Online |9 978-1-4612-0863-1 | ||
020 | |a 9781461269250 |c Print |9 978-1-4612-6925-0 | ||
024 | 7 | |a 10.1007/978-1-4612-0863-1 |2 doi | |
035 | |a (OCoLC)863787022 | ||
035 | |a (DE-599)BVBBV042419651 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 510 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Bridges, Douglas S. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Computability |b A Mathematical Sketchbook |c by Douglas S. Bridges |
264 | 1 | |a New York, NY |b Springer New York |c 1994 | |
300 | |a 1 Online-Ressource (XI, 180 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Graduate Texts in Mathematics |v 146 |x 0072-5285 | |
500 | |a Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Mathematics, general | |
650 | 4 | |a Mathematik | |
650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Funktion |g Mathematik |0 (DE-588)4071510-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Berechenbare Funktion |0 (DE-588)4135762-0 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Funktion |g Mathematik |0 (DE-588)4071510-3 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
689 | 3 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
689 | 3 | |8 4\p |5 DE-604 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-0863-1 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027855068 | ||
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 |
Datensatz im Suchindex
_version_ | 1804153090534801408 |
---|---|
any_adam_object | |
author | Bridges, Douglas S. |
author_facet | Bridges, Douglas S. |
author_role | aut |
author_sort | Bridges, Douglas S. |
author_variant | d s b ds dsb |
building | Verbundindex |
bvnumber | BV042419651 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)863787022 (DE-599)BVBBV042419651 |
dewey-full | 510 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510 |
dewey-search | 510 |
dewey-sort | 3510 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-1-4612-0863-1 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02865nmm a2200589zcb4500</leader><controlfield tag="001">BV042419651</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1994 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461208631</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-0863-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461269250</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-6925-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-0863-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863787022</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419651</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bridges, Douglas S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability</subfield><subfield code="b">A Mathematical Sketchbook</subfield><subfield code="c">by Douglas S. Bridges</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 180 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">Graduate Texts in Mathematics</subfield><subfield code="v">146</subfield><subfield code="x">0072-5285</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</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">Funktion</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4071510-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="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">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-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">Funktion</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4071510-3</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">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</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="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-0863-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027855068</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></record></collection> |
id | DE-604.BV042419651 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:21:05Z |
institution | BVB |
isbn | 9781461208631 9781461269250 |
issn | 0072-5285 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855068 |
oclc_num | 863787022 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (XI, 180 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
publisher | Springer New York |
record_format | marc |
series2 | Graduate Texts in Mathematics |
spelling | Bridges, Douglas S. Verfasser aut Computability A Mathematical Sketchbook by Douglas S. Bridges New York, NY Springer New York 1994 1 Online-Ressource (XI, 180 p) txt rdacontent c rdamedia cr rdacarrier Graduate Texts in Mathematics 146 0072-5285 Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included Mathematics Mathematics, general Mathematik Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Berechenbare Funktion (DE-588)4135762-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Funktion Mathematik (DE-588)4071510-3 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s 1\p DE-604 Berechenbare Funktion (DE-588)4135762-0 s 2\p DE-604 Funktion Mathematik (DE-588)4071510-3 s 3\p DE-604 Turing-Maschine (DE-588)4203525-9 s 4\p DE-604 https://doi.org/10.1007/978-1-4612-0863-1 Verlag Volltext 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 |
spellingShingle | Bridges, Douglas S. Computability A Mathematical Sketchbook Mathematics Mathematics, general Mathematik Turing-Maschine (DE-588)4203525-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Berechenbarkeit (DE-588)4138368-0 gnd Funktion Mathematik (DE-588)4071510-3 gnd |
subject_GND | (DE-588)4203525-9 (DE-588)4135762-0 (DE-588)4138368-0 (DE-588)4071510-3 |
title | Computability A Mathematical Sketchbook |
title_auth | Computability A Mathematical Sketchbook |
title_exact_search | Computability A Mathematical Sketchbook |
title_full | Computability A Mathematical Sketchbook by Douglas S. Bridges |
title_fullStr | Computability A Mathematical Sketchbook by Douglas S. Bridges |
title_full_unstemmed | Computability A Mathematical Sketchbook by Douglas S. Bridges |
title_short | Computability |
title_sort | computability a mathematical sketchbook |
title_sub | A Mathematical Sketchbook |
topic | Mathematics Mathematics, general Mathematik Turing-Maschine (DE-588)4203525-9 gnd Berechenbare Funktion (DE-588)4135762-0 gnd Berechenbarkeit (DE-588)4138368-0 gnd Funktion Mathematik (DE-588)4071510-3 gnd |
topic_facet | Mathematics Mathematics, general Mathematik Turing-Maschine Berechenbare Funktion Berechenbarkeit Funktion Mathematik |
url | https://doi.org/10.1007/978-1-4612-0863-1 |
work_keys_str_mv | AT bridgesdouglass computabilityamathematicalsketchbook |