The annotated Turing: a guided tour through Alan Turing's historic paper on computability and the Turing machine
Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands T...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Indianapolis, Ind.
Wiley
2008
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Zusammenfassung: | Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others. Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41. - Publisher. |
| Beschreibung: | XII, 372 S. 23 cm |
| ISBN: | 0470229055 9780470229057 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023334298 | ||
| 003 | DE-604 | ||
| 005 | 20121016 | ||
| 007 | t | ||
| 008 | 080609s2008 |||| 00||| eng d | ||
| 020 | |a 0470229055 |c (pbk) : £19.99 |9 0-470-22905-5 | ||
| 020 | |a 9780470229057 |9 978-0-470-22905-7 | ||
| 035 | |a (OCoLC)229342525 | ||
| 035 | |a (DE-599)GBV563342609 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-525 |a DE-188 |a DE-355 |a DE-91G |a DE-210 |a DE-2070s |a DE-29T | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511.3/52 |2 22 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 512f |2 stub | ||
| 084 | |a DAT 542f |2 stub | ||
| 100 | 1 | |a Petzold, Charles |d 1953- |e Verfasser |0 (DE-588)136449182 |4 aut | |
| 245 | 1 | 0 | |a The annotated Turing |b a guided tour through Alan Turing's historic paper on computability and the Turing machine |c Charles Petzold |
| 264 | 1 | |a Indianapolis, Ind. |b Wiley |c 2008 | |
| 300 | |a XII, 372 S. |c 23 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others. Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41. - Publisher. | |
| 600 | 1 | 4 | |a Turing, Alan Mathison <1912-1954> |
| 600 | 1 | 4 | |a Turing, Alan Mathison <1912-1954> |
| 600 | 1 | 7 | |a Turing, Alan |d 1912-1954 |0 (DE-588)118802976 |2 gnd |9 rswk-swf |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Turing, Machines de | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Turing machines | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Codierung |0 (DE-588)4070059-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4006804-3 |a Biografie |2 gnd-content | |
| 689 | 0 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 0 | 1 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Turing, Alan |d 1912-1954 |0 (DE-588)118802976 |D p |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 2 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 2 | 2 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 2 | 3 | |a Codierung |0 (DE-588)4070059-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016518182&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016518182 | ||
Datensatz im Suchindex
| _version_ | 1804137684369670145 |
|---|---|
| adam_text | Contents
Introduction
........................
vii
I Foundations
...................... 1
1
This Tomb Holds Diophantus
.............. 3
2
The Irrational and the Transcendental
......... 13
3
Centuries of Progress
.................. 35
II Computable Numbers
................ 55
4
The Education of Alan Turing
.............. 57
5
Machines at Work
.................... 79
6
Addition and Multiplication
............... 97
7
Also Known as Subroutines
............... 111
8
Everything Is a Number
................. 127
9
The Universal Machine
.................. 143
10
Computers and Computability
............. 163
11
Of Machines and Men
.................. 189
III
Das Entscheidungsproblem ............. 199
12
Logic and Computability
................ 201
13
Computable Functions
.................. 231
¡ІШ
Contents
14
The Major
Proof
..................... 259
15
The Lambda
Calculus
.................. 281
16
Conceiving the Continuum...............
299
IV And Beyond
......................323
17
Is Everything a Turing Machine?
............ 325
18
The Long Sleep of Diophantus
............. 351
Selected Bibliography
.................. 361
Index
............................ 366
|
| adam_txt |
Contents
Introduction
.
vii
I Foundations
. 1
1
This Tomb Holds Diophantus
. 3
2
The Irrational and the Transcendental
. 13
3
Centuries of Progress
. 35
II Computable Numbers
. 55
4
The Education of Alan Turing
. 57
5
Machines at Work
. 79
6
Addition and Multiplication
. 97
7
Also Known as Subroutines
. 111
8
Everything Is a Number
. 127
9
The Universal Machine
. 143
10
Computers and Computability
. 163
11
Of Machines and Men
. 189
III
Das Entscheidungsproblem . 199
12
Logic and Computability
. 201
13
Computable Functions
. 231
¡ІШ
Contents
14
The Major
Proof
. 259
15
The Lambda
Calculus
. 281
16
Conceiving the Continuum.
299
IV And Beyond
.323
17
Is Everything a Turing Machine?
. 325
18
The Long Sleep of Diophantus
. 351
Selected Bibliography
. 361
Index
. 366 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Petzold, Charles 1953- |
| author_GND | (DE-588)136449182 |
| author_facet | Petzold, Charles 1953- |
| author_role | aut |
| author_sort | Petzold, Charles 1953- |
| author_variant | c p cp |
| building | Verbundindex |
| bvnumber | BV023334298 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 136 |
| classification_tum | DAT 512f DAT 542f |
| ctrlnum | (OCoLC)229342525 (DE-599)GBV563342609 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03673nam a2200649 c 4500</leader><controlfield tag="001">BV023334298</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20121016 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080609s2008 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0470229055</subfield><subfield code="c">(pbk) : £19.99</subfield><subfield code="9">0-470-22905-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470229057</subfield><subfield code="9">978-0-470-22905-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)229342525</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV563342609</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-703</subfield><subfield code="a">DE-525</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-2070s</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 512f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Petzold, Charles</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136449182</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The annotated Turing</subfield><subfield code="b">a guided tour through Alan Turing's historic paper on computability and the Turing machine</subfield><subfield code="c">Charles Petzold</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Indianapolis, Ind.</subfield><subfield code="b">Wiley</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 372 S.</subfield><subfield code="c">23 cm</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="520" ind1="3" ind2=" "><subfield code="a">Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others. Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41. - Publisher.</subfield></datafield><datafield tag="600" ind1="1" ind2="4"><subfield code="a">Turing, Alan Mathison <1912-1954></subfield></datafield><datafield tag="600" ind1="1" ind2="4"><subfield code="a">Turing, Alan Mathison <1912-1954></subfield></datafield><datafield tag="600" ind1="1" ind2="7"><subfield code="a">Turing, Alan</subfield><subfield code="d">1912-1954</subfield><subfield code="0">(DE-588)118802976</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing, Machines de</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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="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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Codierung</subfield><subfield code="0">(DE-588)4070059-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4006804-3</subfield><subfield code="a">Biografie</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Turing, Alan</subfield><subfield code="d">1912-1954</subfield><subfield code="0">(DE-588)118802976</subfield><subfield code="D">p</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="3"><subfield code="a">Codierung</subfield><subfield code="0">(DE-588)4070059-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016518182&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016518182</subfield></datafield></record></collection> |
| genre | (DE-588)4006804-3 Biografie gnd-content |
| genre_facet | Biografie |
| id | DE-604.BV023334298 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T20:58:54Z |
| indexdate | 2024-07-09T21:16:08Z |
| institution | BVB |
| isbn | 0470229055 9780470229057 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016518182 |
| oclc_num | 229342525 |
| open_access_boolean | |
| owner | DE-703 DE-525 DE-188 DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-210 DE-2070s DE-29T |
| owner_facet | DE-703 DE-525 DE-188 DE-355 DE-BY-UBR DE-91G DE-BY-TUM DE-210 DE-2070s DE-29T |
| physical | XII, 372 S. 23 cm |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Wiley |
| record_format | marc |
| spelling | Petzold, Charles 1953- Verfasser (DE-588)136449182 aut The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine Charles Petzold Indianapolis, Ind. Wiley 2008 XII, 372 S. 23 cm txt rdacontent n rdamedia nc rdacarrier Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others. Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41. - Publisher. Turing, Alan Mathison <1912-1954> Turing, Alan 1912-1954 (DE-588)118802976 gnd rswk-swf Complexité de calcul (Informatique) Turing, Machines de Computational complexity Turing machines Automatentheorie (DE-588)4003953-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Codierung (DE-588)4070059-8 gnd rswk-swf (DE-588)4006804-3 Biografie gnd-content Turing-Maschine (DE-588)4203525-9 s Berechnungstheorie (DE-588)4005581-4 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Turing, Alan 1912-1954 (DE-588)118802976 p Automatentheorie (DE-588)4003953-5 s Theoretische Informatik (DE-588)4196735-5 s Codierung (DE-588)4070059-8 s Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016518182&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Petzold, Charles 1953- The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine Turing, Alan Mathison <1912-1954> Turing, Alan 1912-1954 (DE-588)118802976 gnd Complexité de calcul (Informatique) Turing, Machines de Computational complexity Turing machines Automatentheorie (DE-588)4003953-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd Turing-Maschine (DE-588)4203525-9 gnd Berechnungstheorie (DE-588)4005581-4 gnd Codierung (DE-588)4070059-8 gnd |
| subject_GND | (DE-588)118802976 (DE-588)4003953-5 (DE-588)4134751-1 (DE-588)4196735-5 (DE-588)4203525-9 (DE-588)4005581-4 (DE-588)4070059-8 (DE-588)4006804-3 |
| title | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine |
| title_auth | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine |
| title_exact_search | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine |
| title_exact_search_txtP | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine |
| title_full | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine Charles Petzold |
| title_fullStr | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine Charles Petzold |
| title_full_unstemmed | The annotated Turing a guided tour through Alan Turing's historic paper on computability and the Turing machine Charles Petzold |
| title_short | The annotated Turing |
| title_sort | the annotated turing a guided tour through alan turing s historic paper on computability and the turing machine |
| title_sub | a guided tour through Alan Turing's historic paper on computability and the Turing machine |
| topic | Turing, Alan Mathison <1912-1954> Turing, Alan 1912-1954 (DE-588)118802976 gnd Complexité de calcul (Informatique) Turing, Machines de Computational complexity Turing machines Automatentheorie (DE-588)4003953-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd Turing-Maschine (DE-588)4203525-9 gnd Berechnungstheorie (DE-588)4005581-4 gnd Codierung (DE-588)4070059-8 gnd |
| topic_facet | Turing, Alan Mathison <1912-1954> Turing, Alan 1912-1954 Complexité de calcul (Informatique) Turing, Machines de Computational complexity Turing machines Automatentheorie Berechnungskomplexität Theoretische Informatik Turing-Maschine Berechnungstheorie Codierung Biografie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016518182&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT petzoldcharles theannotatedturingaguidedtourthroughalanturingshistoricpaperoncomputabilityandtheturingmachine |