Includes many examples and figures. GENERAL TOPOLOGY. Set Theory and Logic. Topological Spaces and Continuous Functions. Connectedness and Compactness. Countability and Separation Axioms. The Tychonoff Theorem. Metrization Theorems and paracompactness. Complete Metric Spaces and Function Spaces. Baire Spaces and Dimension Theory. ALGEBRAIC TOPOLOGY. The Fundamental Group. Separation Theorems. The Seifert-van Kampen Theorem. Classification of Surfaces. Classification of Covering Spaces. Applications to Group Theory. For anyone needing a basic, thorough, introduction to general and algebraic topology and its applications.

    

    It is designed as a reference for students in the physical sciences and engineering.

    Now that machine learning is thriving, even programmers who know close to nothing about this technology can use simple, efficient tools to implement programs capable of learning from data. This practical book shows you how.By using concrete examples, minimal theory, and two production-ready Python frameworks—Scikit-Learn and TensorFlow—author Aurélien Géron helps you gain an intuitive understanding of the concepts and tools for building intelligent systems. You’ll learn how to use a range of techniques, starting with simple Linear Regression and progressing to Deep Neural Networks. If you have some programming experience and you’re ready to code a machine learning project, this guide is for you.This hands-on book shows you how to use:Scikit-Learn, an accessible framework that implements many algorithms efficiently and serves as a great machine learning entry pointTensorFlow, a more complex library for distributed numerical computation, ideal for training and running very large neural networksPractical code examples that you can apply without learning excessive machine learning theory or algorithm details

    The author has a direct style. His book presents detailed and intensive explanations. Many diagrams and key examples are used to aid understanding, as well as the application of calculus to physics and engineering and economics. The text is well organized, and it covers single variable and multivariable calculus in depth. An instructor's manual and student guide are available online at http: //ocw.mit.edu/ans7870/resources/Strang/....

    This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, -The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory.- Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper, -On Computable Numbers, with an Application to the Entscheidungsproblem, - Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.

    This book provides an introduction to the field of solid state physics for undergraduate students in physics, chemistry, engineering, and materials science.

    The book's careful account is a contemporary balance between theory, application, and historical development, providing it's readers with an insight into how mathematics progresses and is in turn influenced by the natural world.

    A number of the key figures in the new edition are revised to provide a more inviting and informative treatment. The figures are broken into component parts with supporting commentary so that they can more readily see the key ideas. Material from The Flying Circus is incorporated into the chapter opener puzzlers, sample problems, examples and end-of-chapter problems to make the subject more engaging. Checkpoints enable them to check their understanding of a question with some reasoning based on the narrative or sample problem they just read. Sample Problems also demonstrate how engineers can solve problems with reasoned solutions.

    The rise of the Internet and the wide availability of inexpensive computers have made it possible to gather and analyze network data on a large scale, and the development of a variety of new theoretical tools has allowed us to extract new knowledge from many different kinds of networks.The study of networks is broadly interdisciplinary and important developments have occurred in many fields, including mathematics, physics, computer and information sciences, biology, and the social sciences. This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.Subjects covered include the measurement and structure of networks in many branches of science, methods for analyzing network data, including methods developed in physics, statistics, and sociology, the fundamentals of graph theory, computer algorithms, and spectral methods, mathematical models of networks, including random graph models and generative models, and theories of dynamical processes taking place on networks.

    This introductory text is suitable for use in a course on the subject or for self-study, featuring broad coverage and a readable exposition, with many examples and exercises. The four main chapters present the basics: fundamental group and covering spaces, homology and cohomology, higher homotopy groups, and homotopy theory generally. The author emphasizes the geometric aspects of the subject, which helps students gain intuition. A unique feature is the inclusion of many optional topics not usually part of a first course due to time constraints: Bockstein and transfer homomorphisms, direct and inverse limits, H-spaces and Hopf algebras, the Brown representability theorem, the James reduced product, the Dold-Thom theorem, and Steenrod squares and powers.

    joyfully shows you how to make nature's numbers dance."--Bill Nye (the science guy)The Magic of Math is the math book you wish you had in school. Using a delightful assortment of examples-from ice-cream scoops and poker hands to measuring mountains and making magic squares-this book revels in key mathematical fields including arithmetic, algebra, geometry, and calculus, plus Fibonacci numbers, infinity, and, of course, mathematical magic tricks. Known throughout the world as the "mathemagician," Arthur Benjamin mixes mathematics and magic to make the subject fun, attractive, and easy to understand for math fan and math-phobic alike."A positively joyful exploration of mathematics."-Publishers Weekly, starred review"Each [trick] is more dazzling than the last."-Physics World

    'Big data', 'data science', and 'machine learning' have become familiar terms in the news, as statistical methods are brought to bear upon the enormous data sets of modern science and commerce. How did we get here? And where are we going? This book takes us on an exhilarating journey through the revolution in data analysis following the introduction of electronic computation in the 1950s. Beginning with classical inferential theories - Bayesian, frequentist, Fisherian - individual chapters take up a series of influential topics: survival analysis, logistic regression, empirical Bayes, the jackknife and bootstrap, random forests, neural networks, Markov chain Monte Carlo, inference after model selection, and dozens more. The distinctly modern approach integrates methodology and algorithms with statistical inference. The book ends with speculation on the future direction of statistics and data science.

    It now has 600,000 to a million page hits daily. Every now and then, Munroe would get emails asking him to arbitrate a science debate. 'My friend and I were arguing about what would happen if a bullet got struck by lightning, and we agreed that you should resolve it . . . ' He liked these questions so much that he started up What If. If your cells suddenly lost the power to divide, how long would you survive? How dangerous is it, really, to be in a swimming pool in a thunderstorm? If we hooked turbines to people exercising in gyms, how much power could we produce? What if everyone only had one soulmate?When (if ever) did the sun go down on the British empire? How fast can you hit a speed bump while driving and live?What would happen if the moon went away?In pursuit of answers, Munroe runs computer simulations, pores over stacks of declassified military research memos, solves differential equations, and consults with nuclear reactor operators. His responses are masterpieces of clarity and hilarity, studded with memorable cartoons and infographics. They often predict the complete annihilation of humankind, or at least a really big explosion. Far more than a book for geeks, WHAT IF: Serious Scientific Answers to Absurd Hypothetical Questions explains the laws of science in operation in a way that every intelligent reader will enjoy and feel much the smarter for having read.

    The book s two-part coverage organizes topics under basic theory, and assembles an arsenal of approximation schemes with illustrative applications. For physicists and engineers. "