Computer science seeks to provide a scientific basis for the study of inform a tion processing, the solution of problems by algorithms, and the design and programming of computers. The last forty 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. The present volume is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathe matical developments in computer science readily accessible to under graduate and beginning graduate students. Specifically, this volume takes readers with little or no mathematical background beyond high school algebra, and gives them a taste of a number of topics in theoretical computer science while laying the mathematical foundation for the later, more detailed, study of such topics as formal language theory, computability theory, programming language semantics, and the study of program verification and correctness. Chapter 1 introduces the basic concepts of set theory, with special emphasis on functions and relations, using a simple algorithm to provide motivation. Chapter 2 presents the notion of inductive proof and gives the reader a good grasp on one of the most important notions of computer science: the recursive definition of functions and data structures.
Erscheinungsdatum: 14.12.2011

lgrsnf/A:/compressed/10.1007%2F978-1-4613-9455-6.pdf

nexusstc/A Basis for Theoretical Computer Science/e849267aa0afd3f6c47de4a9abee5ab1.pdf

scihub/10.1007/978-1-4613-9455-6.pdf

zlib/Computers/Computer Science/Michael A. Arbib, A. J. Kfoury, Robert N. Moll/A Basis for Theoretical Computer Science_2116304.pdf

by Michael A. Arbib, A. J. Kfoury, Robert N. Moll

Springer US

Texts and Monographs in Computer Science, The AKM Series in Theoretical Computer Science, Texts and Monographs in Computer Science, The AKM Series in Theoretical Computer Science, New York, NY, United States, 1981

Springer Nature (Textbooks & Major Reference Works), New York, NY, 2012

United States, United States of America

0

sm39875648

{"edition":"softcover reprint of the original 1st ed. 1981","isbns":["1461394554","1461394570","9781461394556","9781461394570"],"last_page":220,"publisher":"Springer New York","series":"Texts and Monographs in Computer Science The AKM Series in Theoretical Computer Science"}

Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.

Front Matter....Pages i-viii
Sets, Maps, and Relations....Pages 1-30
Induction, Strings, and Languages....Pages 31-72
Counting, Recurrences, and Trees....Pages 73-110
Switching Circuits, Proofs, and Logic....Pages 111-144
Binary Relations, Lattices, and Infinity....Pages 145-174
Graphs, Matrices, and Machines....Pages 175-208
Back Matter....Pages 209-220

2013-08-01