From Library Journal
This is an ambitious attempt to define and summarize ``cognitive science,'' a new field of scientific inquiry and knowledge. The author, a leading authority and researcher in this area, writes in a clear, accessible manner; yet, his book conveys the tremendous scope and complexity of this burgeoning field. He convincingly links such seemingly disparate areas as linguistics, computer science, cognitive psychology, structural anthropology, and neuroscience, and attempts to integrate both their historical development and underlying approaches to cognition. Recommended for scholars as an introductory text and for informed laypersons who want a thorough and fascinating grounding in the study of the mind and how it works.

This comprehensive overview of the history of computing and its industry, and of commercial applications of the computer also outlines the history of how computing operations were managed within American companies. Based on extensive research in the contemporary business literature, this work is one of the few which looks at computing as business history, and it is the first to look at the broad scope of computing from the perspective of the business historian. The work is also directed at business managers to help them appreciate and understand the uses of the computer in their firms.

The history of computing could be told as the story of hardware and software, or the story of the Internet, or the story of "smart" hand-held devices, with subplots involving IBM, Microsoft, Apple, Facebook, and Twitter. In this concise and accessible account of the invention and development of digital technology, computer historian Paul Ceruzzi offers a broader and more useful perspective. He identifies four major threads that run throughout all of computing's technological development: digitization--the coding of information, computation, and control in binary form, ones and zeros; the convergence of multiple streams of techniques, devices, and machines, yielding more than the sum of their parts; the steady advance of electronic technology, as characterized famously by "Moore's Law"; and the human-machine interface. Ceruzzi guides us through computing history, telling how a Bell Labs mathematician coined the word "digital" in 1942 (to describe a high-speed method of calculating used in anti-aircraft devices), and recounting the development of the punch card (for use in the 1890 U.S. Census). He describes the ENIAC, built for scientific and military applications; the UNIVAC, the first general purpose computer; and ARPANET, the Internet's precursor. Ceruzzi's account traces the world-changing evolution of the computer from a room-size ensemble of machinery to a "minicomputer" to a desktop computer to a pocket-sized smart phone. He describes the development of the silicon chip, which could store ever-increasing amounts of data and enabled ever-decreasing device size. He visits that hotbed of innovation, Silicon Valley, and brings the story up to the present with the Internet, the World Wide Web, and social networking.

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

Hailed as the Thomas Edison and Henry Ford of Silicon Valley, Robert Noyce was a brilliant inventor, a leading entrepreneur, and a daring risk taker who piloted his own jets and skied mountains accessible only by helicopter. Now, in The Man Behind the Microchip, Leslie Berlin captures not only this colorful individual but also the vibrant interplay of technology, business, money, politics, and culture that defines Silicon Valley. Here is the life of a high-tech industry giant. The co-founder of Fairchild Semiconductor and Intel, Noyce co-invented the integrated circuit, the electronic heart of every modern computer, automobile, cellular telephone, advanced weapon, and video game. With access to never-before-seen documents, Berlin paints a fascinating portrait of Noyce: an ambitious and intensely competitive multimillionaire who exuded a "just folks" sort of charm, a Midwestern preacher's son who rejected organized religion but would counsel his employees to "go off and do something wonderful," a man who never looked back and sometimes paid a price for it. In addition, this vivid narrative sheds light on Noyce's friends and associates, including some of the best-known managers, venture capitalists, and creative minds in Silicon Valley. Berlin draws upon interviews with dozens of key players in modern American business--including Andy Grove, Steve Jobs, Gordon Moore, and Warren Buffett; their recollections of Noyce give readers a privileged, first-hand look inside the dynamic world of high-tech entrepreneurship. A modern American success story, The Man Behind the Microchip illuminates the triumphs and setbacks of one of the most important inventors and entrepreneurs of our time.

Based on a study sponsored by the Council on Library Resources, inc., and conducted by Bolt, Beranek, and Newman, inc., between Nov. 1961 and Nov. 1963

Since the late 1960s the Internet has grown from a single experimental network serving a dozen sites in the United States to a network of networks linking millions of computers worldwide. In Inventing the Internet, Janet Abbate recounts the key players and technologies that allowed the Internet to develop; but her main focus is always on the social and cultural factors that influenced the Internets design and use. The story she unfolds is an often twisting tale of collaboration and conflict among a remarkable variety of players, including government and military agencies, computer scientists in academia and industry, graduate students, telecommunications companies, standards organizations, and network users.The story starts with the early networking breakthroughs formulated in Cold War think tanks and realized in the Defense Department's creation of the ARPANET. It ends with the emergence of the Internet and its rapid and seemingly chaotic growth. Abbate looks at how academic and military influences and attitudes shaped both networks; how the usual lines between producer and user of a technology were crossed with interesting and unique results; and how later users invented their own very successful applications, such as electronic mail and the World Wide Web. She concludes that such applications continue the trend of decentralized, user-driven development that has characterized the Internet's entire history and that the key to the Internet's success has been a commitment to flexibility and diversity, both in technical design and in organizational culture.

OSPF (Open Shortest Path First) is one of the most challenging routing protocols to understand-and one of the most important. In OSPF Complete Implementation, John Moy , OSPF's inventor and primary developer, walks networking professionals through a comprehensive OSPF implementation in C++, step-by-step. A perfect companion to Moy's OSPF: Anatomy of an Internet Routing Protocol (0-201-63472-4), this authoritative guide demonstrates how every part of the standard can be implemented, enabling readers to explore all of the protocol's "nooks and crannies", and to discover never-before-published optimization techniques. Moy explains OSPF's functional specifications, software architecture, and key building blocks. An ideal resource for everyone interested in practical Internet routing: netadmins, protocol designers, protocol software developers, and others involved in designing, developing, or managing TCP/IP networks using OSPF.

“Enigma’s ‘forgotten genius’ . . . [the] story of Alan Turing’s spymaster boss who led the team that cracked Hitler’s WWII codes.” —Daily Mail
The Official Secrets Act and the passing of time have prevented the Bletchley Park story from being told by many of its key participants. Here at last is a book that allows some of them to speak for the first time. Gordon Welchman was one of the Park’s most important figures. Like Alan Turing, his pioneering work was fundamental to the success of Bletchley Park and helped pave the way for the birth of the digital age. Yet, his story is largely unknown to many. His book, The Hut Six Story, was the first to reveal not only how they broke the codes, but how it was done on an industrial scale. Its publication created such a stir in GCHQ and the NSA that Welchman was forbidden to discuss the book or his wartime work with the media.
In order to finally set the record straight, Bletchley Park historian and tour guide Joel Greenberg has drawn on Welchman’s personal papers and correspondence with wartime colleagues that lay undisturbed in his son’s loft for many years. Packed with fascinating new insights, including Welchman’s thoughts on key Bletchley figures and the development of the bombe machine, this is essential reading for anyone interested in the clandestine activities at Bletchley Park.
“A magnificent biography which finally provides recognition to one of Bletchley’s and Britain’s lost heroes.” —Michael Smith
“Reveals a man equally as fascinating equally as important as Turing, and tells us even more about what went on in this most secret of establishments during the war years.” —Books Monthly

This easy-to-read 2010 book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it is possible to construct a regular polygon with any number of sides. This remarkable algorithm has led to interesting proofs of certain results in number theory, has been used to answer combinatorial questions involving partitions of space, and has enabled the authors to obtain the formula for the volume of a regular tetrahedron in around three steps, using nothing more complicated than basic arithmetic and the most elementary plane geometry. All of these ideas, and more, reveal the beauty of mathematics and the interconnectedness of its various branches. Detailed instructions, including clear illustrations, enable the reader to gain hands-on experience constructing these models and to discover for themselves the patterns and relationships they unearth.

The field of molecular evolution has experienced explosive growth in recent years due to the rapid accumulation of genetic sequence data, continuous improvements to computer hardware and software, and the development of sophisticated analytical methods. The increasing availability of large genomic data sets requires powerful statistical methods to analyze and interpret them, generating both computational and conceptual challenges for the field.
Computational Molecular Evolution provides an up-to-date and comprehensive coverage of modern statistical and computational methods used in molecular evolutionary analysis, such as maximum likelihood and Bayesian statistics. Yang describes the models, methods and algorithms that are most useful for analysing the ever-increasing supply of molecular sequence data, with a view to furthering our understanding of the evolution of genes and genomes. The book emphasizes essential concepts rather than mathematical proofs. It includes detailed derivations and implementation details, as well as numerous illustrations, worked examples, and exercises. It will be of relevance and use to students and professional researchers (both empiricists and theoreticians) in the fields of molecular phylogenetics, evolutionary biology, population genetics, mathematics, statistics and computer science. Biologists who have used phylogenetic software programs to analyze their own data will find the book particularly rewarding, although it should appeal to anyone seeking an authoritative overview of this exciting area of computational biology.

This is an introduction to Bayesian statistics and decision theory, including advanced topics such as Monte Carlo methods. This new edition contains several revised chapters and a new chapter on model choice.

The famous physicist's timeless lectures on the promise and limitations of computers
When, in 1984-86, Richard P. Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a "Feynmanesque" overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover volumes, Wiley hopes to extend the lives of these works by making them available to future generations of statisticians, mathematicians, and scientists. "This text is unique in bringing together so many results hitherto found only in part in other texts and papers...The text is fairly self-contained, inclusive of some basic mathematical results needed, and provides a rich diet of examples, applications, and exercises. The bibliographical material at the end of each chapter is excellent, not only from a historical perspective, but because it is valuable for researchers in acquiring a good perspective of the MDP research potential." -Zentralblatt fur Mathematik "...it is of great value to advanced-level students, researchers, and professional practitioners of this field to have now a complete volume (with more than 600 pages) devoted to this topic...Markov Decision Processes: Discrete Stochastic Dynamic Programming represents an up-to-date, unified, and rigorous treatment of theoretical and computational aspects of discrete-time Markov decision processes. " -Journal of the American Statistical Association

This text is a comprehensive introduction to the main ideas and techniques of the field of quantum computation and quantum information. Until now, the rapid rate of progress and its cross-disciplinary nature have made it difficult for newcomers to the field to obtain a broad overview of the most important techniques and results.
Michael Nielsen and Isaac Chuang ask the question: what are the ultimate physical limits to computation and communication? They describe in detail such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error-correction. A wealth of accompanying figures and exercises illustrate and develop the material in more depth. A special feature is the tutorial introductions to quantum mechanics and computer science included in Part I of the book, ensuring that the subject is accessible even without a background in physics or computer science. In Part II, the authors present quantum computation, and describe what a quantum computer is, how it can be used to solve problems faster than familiar 'classical' computers, and the real-world implementation of quantum computers. Part III concludes the book with an in-depth treatment of quantum information, explaining how quantum states can be used to perform remarkable feats of communication, together with a discussion of how it is possible to protect quantum states against the effects of noise.
This exciting text will be of interest to beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering with an interest in quantum computation and quantum information, and may be
used as a text in courses on the subject.

This book covers the field of machine learning, which is the study of algorithms that allow computer programs to automatically improve through experience. The book is intended to support upper level undergraduate and introductory level graduate courses in machine learning.