A Programming Approach to Computability:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer New York
1982
|
| Schriftenreihe: | Texts and Monographs in Computer Science
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine |
| Beschreibung: | 1 Online-Ressource (VIII, 251p. 36 illus) |
| ISBN: | 9781461257493 9781461257516 |
| ISSN: | 0172-603X |
| DOI: | 10.1007/978-1-4612-5749-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042420422 | ||
| 003 | DE-604 | ||
| 005 | 20171011 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1982 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461257493 |c Online |9 978-1-4612-5749-3 | ||
| 020 | |a 9781461257516 |c Print |9 978-1-4612-5751-6 | ||
| 024 | 7 | |a 10.1007/978-1-4612-5749-3 |2 doi | |
| 035 | |a (OCoLC)906719088 | ||
| 035 | |a (DE-599)BVBBV042420422 | ||
| 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 519 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Kfoury, A. J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A Programming Approach to Computability |c by A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| 264 | 1 | |a New York, NY |b Springer New York |c 1982 | |
| 300 | |a 1 Online-Ressource (VIII, 251p. 36 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts and Monographs in Computer Science |x 0172-603X | |
| 500 | |a Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Software engineering | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Software Engineering | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Rekursive Funktion |0 (DE-588)4138367-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Rekursive Funktion |0 (DE-588)4138367-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Moll, Robert N. |e Sonstige |4 oth | |
| 700 | 1 | |a Arbib, Michael A. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-5749-3 |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-027855839 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804153092303749120 |
|---|---|
| any_adam_object | |
| author | Kfoury, A. J. |
| author_facet | Kfoury, A. J. |
| author_role | aut |
| author_sort | Kfoury, A. J. |
| author_variant | a j k aj ajk |
| building | Verbundindex |
| bvnumber | BV042420422 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)906719088 (DE-599)BVBBV042420422 |
| dewey-full | 519 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519 |
| dewey-search | 519 |
| dewey-sort | 3519 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4612-5749-3 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03644nmm a2200601zc 4500</leader><controlfield tag="001">BV042420422</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171011 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1982 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461257493</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-5749-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461257516</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-5751-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-5749-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)906719088</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420422</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">519</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">Kfoury, A. J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Programming Approach to Computability</subfield><subfield code="c">by A. J. Kfoury, Robert N. Moll, Michael A. Arbib</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">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 251p. 36 illus)</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 and Monographs in Computer Science</subfield><subfield code="x">0172-603X</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</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">Software Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-9</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="700" ind1="1" ind2=" "><subfield code="a">Moll, Robert N.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Arbib, Michael A.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-5749-3</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-027855839</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></record></collection> |
| id | DE-604.BV042420422 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:06Z |
| institution | BVB |
| isbn | 9781461257493 9781461257516 |
| issn | 0172-603X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855839 |
| oclc_num | 906719088 |
| 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 (VIII, 251p. 36 illus) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| publisher | Springer New York |
| record_format | marc |
| series2 | Texts and Monographs in Computer Science |
| spelling | Kfoury, A. J. Verfasser aut A Programming Approach to Computability by A. J. Kfoury, Robert N. Moll, Michael A. Arbib New York, NY Springer New York 1982 1 Online-Ressource (VIII, 251p. 36 illus) txt rdacontent c rdamedia cr rdacarrier Texts and Monographs in Computer Science 0172-603X Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine Mathematics Software engineering Computer science Applications of Mathematics Computation by Abstract Devices Software Engineering Informatik Mathematik Rekursive Funktion (DE-588)4138367-9 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s Programmierung (DE-588)4076370-5 s 1\p DE-604 Rekursive Funktion (DE-588)4138367-9 s 2\p DE-604 Moll, Robert N. Sonstige oth Arbib, Michael A. Sonstige oth https://doi.org/10.1007/978-1-4612-5749-3 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 |
| spellingShingle | Kfoury, A. J. A Programming Approach to Computability Mathematics Software engineering Computer science Applications of Mathematics Computation by Abstract Devices Software Engineering Informatik Mathematik Rekursive Funktion (DE-588)4138367-9 gnd Programmierung (DE-588)4076370-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4138367-9 (DE-588)4076370-5 (DE-588)4138368-0 |
| title | A Programming Approach to Computability |
| title_auth | A Programming Approach to Computability |
| title_exact_search | A Programming Approach to Computability |
| title_full | A Programming Approach to Computability by A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| title_fullStr | A Programming Approach to Computability by A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| title_full_unstemmed | A Programming Approach to Computability by A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| title_short | A Programming Approach to Computability |
| title_sort | a programming approach to computability |
| topic | Mathematics Software engineering Computer science Applications of Mathematics Computation by Abstract Devices Software Engineering Informatik Mathematik Rekursive Funktion (DE-588)4138367-9 gnd Programmierung (DE-588)4076370-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Mathematics Software engineering Computer science Applications of Mathematics Computation by Abstract Devices Software Engineering Informatik Mathematik Rekursive Funktion Programmierung Berechenbarkeit |
| url | https://doi.org/10.1007/978-1-4612-5749-3 |
| work_keys_str_mv | AT kfouryaj aprogrammingapproachtocomputability AT mollrobertn aprogrammingapproachtocomputability AT arbibmichaela aprogrammingapproachtocomputability |