You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book introduces law to computer scientists and other folk. Computer scientists develop, protect, and maintain computing systems in the broad sense of that term, whether hardware (a smartphone, a driverless car, a smart energy meter, a laptop, or a server), software (a program, an application programming interface or API, a module, code), or data (captured via cookies, sensors, APIs, or manual input). Computer scientists may be focused on security (e.g. cryptography), or on embedded systems (e.g. the Internet of Things), or on data science (e.g. machine learning). They may be closer to mathematicians or to electrical or electronic engineers, or they may work on the cusp of hardware and s...
The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After presenting the necessary prerequisites, the material is organized to look at different aspects of quantum computing from the specific standpoint of computer science. There are chapters on computer architecture, algorithms, programming languages, theoretical computer science, cryptography, information theory, and hardware. The text has step-by-step examples, more than two hundred exercises with solutions, and programming drills that bring the ideas of quantum computing alive for today's computer science students and researchers.
A complete update to a classic, respected resource Invaluable reference, supplying a comprehensive overview on how to undertake and present research
Profiles more than 100 scientists from around the world who made important contributions to the study of computer science, including Howard Aiken, Steve Case, Steve Jobs, and Ted Nelson.
This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. The classic text is replete with illustrative examples and exercises. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists.
Praise for the previous edition: "Entries are written with enough clarity and simplicity to appeal to general audiences. The additional readings that end each profile give excellent pointers for more detailed information...Recommended."—Choice "This well-written collection of biographies of the most important contributors to the computer world...is a valuable resource for those interested in the men and women who were instrumental in making the world we live in today. This is a recommended purchase for reference collections."—American Reference Books Annual "...this one is recommended for high-school, public, and undergraduate libraries."—Booklist The significant role that the computer...
"Ada, Countess of Lovelace and daughter of Romantic poet Lord Byron, is sometimes referred to as the world's first computer programmer. But how did a young woman in the nineteenth century without a formal education become a pioneer of computer science? Drawing on previously unpublished archival material, including a remarkable correspondence course with eminent mathematician Augustus De Morgan, this book explores Ada Lovelace's development from her precocious childhood into a gifted, perceptive and knowledgeable mathematician who, alongside Mary Somerville, Michael Faraday and Charles Dickens, became part of Victorian London's social and scientific elite. Featuring images of the 'first programme' together with mathematical models and contemporary illustrations, the authors show how, despite her relatively short life and with astonishing prescience, Ada Lovelace explored key mathematical questions to understand the principles behind modern computing."--Page 4 de la couverture.
This book is designed specifically as a guide for Computer Scientists needing an introduction to Cell Biology. The text explores three different facets of biology: biological systems, experimental methods, and language and nomenclature. The author discusses what biologists are trying to determine from their experiments, how various experimental procedures are used and how they relate to accepted concepts in computer science, and the vocabulary necessary to read and understand current literature in biology. The book is an invaluable reference tool and an excellent starting point for a more comprehensive examination of cell biology.
Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Contents Tutorial • Applications • Further Reading
This easy-to-follow textbook/reference presents a concise introduction to mathematical analysis from an algorithmic point of view, with a particular focus on applications of analysis and aspects of mathematical modelling. The text describes the mathematical theory alongside the basic concepts and methods of numerical analysis, enriched by computer experiments using MATLAB, Python, Maple, and Java applets. This fully updated and expanded new edition also features an even greater number of programming exercises. Topics and features: describes the fundamental concepts in analysis, covering real and complex numbers, trigonometry, sequences and series, functions, derivatives, integrals, and curve...