Overview
Part of the book series: Monographs in Computer Science (MCS)
Part of the book sub series: The AKM Series in Theoretical Computer Science (TMCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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 develop ment of mathematical techniques to allow the rigorous specification of program, process, and machine.
Similar content being viewed by others
Keywords
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
Bibliographic Information
Book Title: A Programming Approach to Computability
Authors: A. J. Kfoury, Robert N. Moll, Michael A. Arbib
Series Title: Monographs in Computer Science
DOI: https://doi.org/10.1007/978-1-4612-5749-3
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag New York Inc. 1982
Softcover ISBN: 978-1-4612-5751-6Published: 08 November 2011
eBook ISBN: 978-1-4612-5749-3Published: 06 December 2012
Series ISSN: 0172-603X
Series E-ISSN: 2512-5486
Edition Number: 1
Number of Pages: VIII, 251
Topics: Applications of Mathematics, Computation by Abstract Devices, Software Engineering