Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.

Computing is an exact science and the systematic study of any aspect necessarily involves the use of mathematical models. Moreover, the rate at which the subject is evolving demands a facility for developing new mathematical systems to keep pace with new computing systems and this requires an appreciation of how mathematics works. An understanding of the underlying mathematical structure facilitates the construction of suitable computer programs to perform computations. Assuming no specific knowledge of mathematics, the authors describe all the basic concepts required and progress from sets (rather than numbers) through a variety of algebraic structures that permit the precise description, specification and subsequent analysis of many problems in computing. The material included provides the essential mathematical foundations for core topics of computer science and extends into the areas of language theory, abstract machine theory and computer geometry. Computer Mathematics will be of interest to undergraduate students of computer science and mathematics, post-graduate computing 'conversion' course students and computer professionals who need an introduction to the mathematics that underpins computer science theory.

"The book is suitable as a text for a first course in numerical methods for mathematics students or students in neighboring fields, such as engineering, physics, and computer science. In general, the author assumes only a knowledge of calculus and linear algebra."--BOOK JACKET.

This compact, well-written history — first published in 1948, and now in its fourth revised edition — describes the main trends in the development of all fields of mathematics from the first available records to the middle of the 20th century. Students, researchers, historians, specialists — in short, everyone with an interest in mathematics — will find it engrossing and stimulating. Beginning with the ancient Near East, the author traces the ideas and techniques developed in Egypt, Babylonia, China, and Arabia, looking into such manuscripts as the Egyptian Papyrus Rhind, the Ten Classics of China, and the Siddhantas of India. He considers Greek and Roman developments from their beginnings in Ionian rationalism to the fall of Constantinople; covers medieval European ideas and Renaissance trends; analyzes 17th- and 18th-century contributions; and offers an illuminating exposition of 19th century concepts. Every important figure in mathematical history is dealt with — Euclid, Archimedes, Diophantus, Omar Khayyam, Boethius, Fermat, Pascal, Newton, Leibniz, Fourier, Gauss, Riemann, Cantor, and many others. For this latest edition, Dr. Struik has both revised and updated the existing text, and also added a new chapter on the mathematics of the first half of the 20th century. Concise coverage is given to set theory, the influence of relativity and quantum theory, tensor calculus, the Lebesgue integral, the calculus of variations, and other important ideas and concepts. The book concludes with the beginnings of the computer era and the seminal work of von Neumann, Turing, Wiener, and others. "The author's ability as a first-class historian as well as an able mathematician has enabled him to produce a work which is unquestionably one of the best." — Nature Magazine.

Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Logic, Operations, and Computational Mathematics and Geometry. The editors have built Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Logic, Operations, and Computational Mathematics and Geometry in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Logic, Operations, and Computational Mathematics and Geometry: 2011 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

The Concise Encyclopedia of Computer Science has been adapted from the full Fourth Edition to meet the needs of students, teachers and professional computer users in science and industry. As an ideal desktop reference, it contains shorter versions of 60% of the articles found in the Fourth Edition, putting computer knowledge at your fingertips. Organised to work for you, it has several features that make it an invaluable and accessible reference. These include: Cross references to closely related articles to ensure that you don’t miss relevant information Appendices covering abbreviations and acronyms, notation and units, and a timeline of significant milestones in computing have been included to ensure that you get the most from the book. A comprehensive index containing article titles, names of persons cited, references to sub-categories and important words in general usage, guarantees that you can easily find the information you need. Classification of articles around the following nine main themes allows you to follow a self study regime in a particular area: Hardware Computer Systems Information and Data Software Mathematics of Computing Theory of Computation Methodologies Applications Computing Milieux. Presenting a wide ranging perspective on the key concepts and developments that define the discipline, the Concise Encyclopedia of Computer Science is a valuable reference for all computer users.

Upon publication, the first edition of the CRC Concise Encyclopedia of Mathematics received overwhelming accolades for its unparalleled scope, readability, and utility. It soon took its place among the top selling books in the history of Chapman & Hall/CRC, and its popularity continues unabated. Yet also unabated has been the d

Mathematical logic developed into a broad discipline with many applications in mathematics, informatics, linguistics and philosophy. This text introduces the fundamentals of this field, and this new edition has been thoroughly expanded and revised.

Proceedings of an International Conference held in Vancouver, B.C., August 1993, to commemorate the 50th anniversary of the founding of the journal Mathematics of Computation. It consisted of a Symposium on Numerical Analysis and a Minisymposium of Computational Number Theory. This proceedings contains 14 invited papers, including two not presented at the conference--an historical essay on integer factorization, and a paper on componentwise perturbation bounds in linear algebra. The invited papers present surveys on the various subdisciplines covered by Mathematics of Computation, in a historical perspective and in a language accessible to a wide audience. The 46 contributed papers address contemporary specialized work. Annotation copyright by Book News, Inc., Portland, OR

MathematicsMechanization consistsoftheory,softwareandapplicationofc- puterized mathematical activities such as computing, reasoning and discovering. ItsuniquefeaturecanbesuccinctlydescribedasAAA(Algebraization,Algori- mization, Application). The name “Mathematics Mechanization” has its origin in the work of Hao Wang (1960s), one of the pioneers in using computers to do research in mathematics, particularly in automated theorem proving. Since the 1970s, this research direction has been actively pursued and extensively dev- oped by Prof. Wen-tsun Wu and his followers. It di?ers from the closely related disciplines like Computer Mathematics, Symbolic Computation and Automated Reasoning in that its goal is to make algorithmic studies and applications of mathematics the major trend of mathematics development in the information age. The International Workshop on Mathematics Mechanization (IWMM) was initiated by Prof. Wu in 1992, and has ever since been held by the Key L- oratory of Mathematics Mechanization (KLMM) of the Chinese Academy of Sciences. There have been seven workshops of the series up to now. At each workshop, several experts are invited to deliver plenary lectures on cutting-edge methods and algorithms of the selected theme. The workshop is also a forum for people working on related subjects to meet, collaborate and exchange ideas.