A panorama of new ideas in mathematics that are driving innovation in computing and communications.

Alan Turing (1912–1954) made seminal contributions to mathematical logic, computation, computer science, artificial intelligence, cryptography and theoretical biology. In this volume, outstanding scientific thinkers take a fresh look at the great range of Turing's contributions, on how the subjects have developed since his time, and how they might develop still further. The contributors include Martin Davis, J. M. E. Hyland, Andrew R. Booker, Ueli Maurer, Kanti V. Mardia, S. Barry Cooper, Stephen Wolfram, Christof Teuscher, Douglas Richard Hofstadter, Philip K. Maini, Thomas E. Woolley, Eamonn A. Gaffney, Ruth E. Baker, Richard Gordon, Stuart Kauffman, Scott Aaronson, Solomon Feferman, P. D. Welch and Roger Penrose. These specially commissioned essays will provoke and engross the reader who wishes to understand better the lasting significance of one of the twentieth century's deepest thinkers.

Mathematical techniques pervade current research in computer networking, yet are not taught to most computer science undergraduates. This self-contained, highly-accessible book bridges the gap, providing the mathematical grounding students and professionals need to successfully design or evaluate networking systems. The only book of its kind, it brings together information previously scattered amongst multiple texts. It first provides crucial background in basic mathematical tools, and then illuminates the specific theories that underlie computer networking. Coverage includes: * Basic probability * Statistics * Linear Algebra * Optimization * Signals, Systems, and Transforms, including Fourier series and transforms, Laplace transforms, DFT, FFT, and Z transforms * Queuing theory * Game Theory * Control theory * Information theory

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

Computers are increasingly the enabling devices of the information revolution, and computing is becoming ubiquitous in every corner of society, from manufacturing to telecommunications to pharmaceuticals to entertainment. Even more importantly, the face of computing is changing rapidly, as even traditional rivals such as IBM and Apple Computer begin to cooperate and new modes of computing are developed. Computing the Future presents a timely assessment of academic computer science and engineering (CS&E), examining what should be done to ensure continuing progress in making discoveries that will carry computing into the twenty-first century. Most importantly, it advocates a broader research and educational agenda that builds on the field's impressive accomplishments. The volume outlines a framework of priorities for CS&E, along with detailed recommendations for education, funding, and leadership. A core research agenda is outlined for these areas: processors and multiple-processor systems, data communications and networking, software engineering, information storage and retrieval, reliability, and user interfaces. This highly readable volume examines: Computer science and engineering as a discipline-how computer scientists and engineers are pushing back the frontiers of their field. How CS&E must change to meet the challenges of the future. The influence of strategic investment by federal agencies in CS&E research. Recent structural changes that affect the interaction of academic CS&E and the business environment. Specific examples of interdisciplinary and applications research in four areas: earth sciences and the environment, computational biology, commercial computing, and the long-term goal of a national electronic library. The volume provides a detailed look at undergraduate CS&E education, highlighting the limitations of four-year programs, and discusses the emerging importance of a master's degree in CS&E and the prospects for broadening the scope of the Ph.D. It also includes a brief look at continuing education.