Computability and Decidability: An Introduction for Students of Computer Science
The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1972
|
| Ausgabe: | 1st ed. 1972 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
68 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a great number of informal comments are inserted in order to allow a good intuitive understanding. I am indebted to all those who drew my attention to some errors and ambiguities in a preliminary version of these Notes. I want also to thank Miss L.A. Krukerink for her diligence in typing the manuscript |
| Beschreibung: | 1 Online-Ressource (VI, 78 p) |
| ISBN: | 9783642806896 |
| DOI: | 10.1007/978-3-642-80689-6 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046873552 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1972 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642806896 |9 978-3-642-80689-6 | ||
| 024 | 7 | |a 10.1007/978-3-642-80689-6 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-642-80689-6 | ||
| 035 | |a (OCoLC)863816493 | ||
| 035 | |a (DE-599)BVBBV046873552 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a ES 920 |0 (DE-625)27929: |2 rvk | ||
| 084 | |a QH 500 |0 (DE-625)141607: |2 rvk | ||
| 084 | |a SI 853 |0 (DE-625)143200: |2 rvk | ||
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 100 | 1 | |a Loeckx, J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computability and Decidability |b An Introduction for Students of Computer Science |c by J. Loeckx |
| 250 | |a 1st ed. 1972 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1972 | |
| 300 | |a 1 Online-Ressource (VI, 78 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Economics and Mathematical Systems |v 68 | |
| 520 | |a The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a great number of informal comments are inserted in order to allow a good intuitive understanding. I am indebted to all those who drew my attention to some errors and ambiguities in a preliminary version of these Notes. I want also to thank Miss L.A. Krukerink for her diligence in typing the manuscript | ||
| 650 | 4 | |a Math Applications in Computer Science | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |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 Entscheidbarkeit |0 (DE-588)4152398-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |D s |
| 689 | 0 | 1 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540058694 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642806902 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-80689-6 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032283684 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-80689-6 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181723838152704 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Loeckx, J. |
| author_facet | Loeckx, J. |
| author_role | aut |
| author_sort | Loeckx, J. |
| author_variant | j l jl |
| building | Verbundindex |
| bvnumber | BV046873552 |
| classification_rvk | ES 920 QH 500 SI 853 ST 120 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-642-80689-6 (OCoLC)863816493 (DE-599)BVBBV046873552 |
| 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 Sprachwissenschaft Mathematik Literaturwissenschaft Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Sprachwissenschaft Mathematik Literaturwissenschaft Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-642-80689-6 |
| edition | 1st ed. 1972 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03637nmm a2200565zcb4500</leader><controlfield tag="001">BV046873552</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1972 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642806896</subfield><subfield code="9">978-3-642-80689-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-80689-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-642-80689-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863816493</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046873552</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-634</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">ES 920</subfield><subfield code="0">(DE-625)27929:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 500</subfield><subfield code="0">(DE-625)141607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 853</subfield><subfield code="0">(DE-625)143200:</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">Loeckx, J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and Decidability</subfield><subfield code="b">An Introduction for Students of Computer Science</subfield><subfield code="c">by J. Loeckx</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1972</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VI, 78 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">Lecture Notes in Economics and Mathematical Systems</subfield><subfield code="v">68</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a great number of informal comments are inserted in order to allow a good intuitive understanding. I am indebted to all those who drew my attention to some errors and ambiguities in a preliminary version of these Notes. I want also to thank Miss L.A. Krukerink for her diligence in typing the manuscript</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</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">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">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</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="689" ind1="1" 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="1" 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">9783540058694</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">9783642806902</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-80689-6</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032283684</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-80689-6</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046873552 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:39Z |
| indexdate | 2024-07-10T08:56:12Z |
| institution | BVB |
| isbn | 9783642806896 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032283684 |
| oclc_num | 863816493 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (VI, 78 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1972 |
| publishDateSearch | 1972 |
| publishDateSort | 1972 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Lecture Notes in Economics and Mathematical Systems |
| spelling | Loeckx, J. Verfasser aut Computability and Decidability An Introduction for Students of Computer Science by J. Loeckx 1st ed. 1972 Berlin, Heidelberg Springer Berlin Heidelberg 1972 1 Online-Ressource (VI, 78 p) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Economics and Mathematical Systems 68 The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a great number of informal comments are inserted in order to allow a good intuitive understanding. I am indebted to all those who drew my attention to some errors and ambiguities in a preliminary version of these Notes. I want also to thank Miss L.A. Krukerink for her diligence in typing the manuscript Math Applications in Computer Science Computer science—Mathematics Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 gnd rswk-swf Entscheidbarkeit (DE-588)4152398-2 s Berechenbarkeit (DE-588)4138368-0 s DE-604 Turing-Maschine (DE-588)4203525-9 s Erscheint auch als Druck-Ausgabe 9783540058694 Erscheint auch als Druck-Ausgabe 9783642806902 https://doi.org/10.1007/978-3-642-80689-6 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Loeckx, J. Computability and Decidability An Introduction for Students of Computer Science Math Applications in Computer Science Computer science—Mathematics Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd Entscheidbarkeit (DE-588)4152398-2 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4203525-9 (DE-588)4152398-2 |
| title | Computability and Decidability An Introduction for Students of Computer Science |
| title_auth | Computability and Decidability An Introduction for Students of Computer Science |
| title_exact_search | Computability and Decidability An Introduction for Students of Computer Science |
| title_exact_search_txtP | Computability and Decidability An Introduction for Students of Computer Science |
| title_full | Computability and Decidability An Introduction for Students of Computer Science by J. Loeckx |
| title_fullStr | Computability and Decidability An Introduction for Students of Computer Science by J. Loeckx |
| title_full_unstemmed | Computability and Decidability An Introduction for Students of Computer Science by J. Loeckx |
| title_short | Computability and Decidability |
| title_sort | computability and decidability an introduction for students of computer science |
| title_sub | An Introduction for Students of Computer Science |
| topic | Math Applications in Computer Science Computer science—Mathematics Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd Entscheidbarkeit (DE-588)4152398-2 gnd |
| topic_facet | Math Applications in Computer Science Computer science—Mathematics Berechenbarkeit Turing-Maschine Entscheidbarkeit |
| url | https://doi.org/10.1007/978-3-642-80689-6 |
| work_keys_str_mv | AT loeckxj computabilityanddecidabilityanintroductionforstudentsofcomputerscience |