Of course, it’s not all cooking; we’ll also run the New York and Chicago marathons, pay visits to Cinderella and Lewis Carroll, and even get to the bottom of a tomato’s identity as a vegetable. This is not the math of our high school classes: mathematics, Cheng shows us, is less about numbers and formulas and more about how we know, believe, and understand anything, including whether our brother took too much cake.At the heart of How to Bake Pi is Cheng’s work on category theory—a cutting-edge “mathematics of mathematics.” Cheng combines her theory work with her enthusiasm for cooking both to shed new light on the fundamentals of mathematics and to give readers a tour of a vast territory no popular book on math has explored before. Lively, funny, and clear, How to Bake Pi will dazzle the initiated while amusing and enlightening even the most hardened math-phobe.

    Written by two of the best-known names in categorical logic, Conceptual Mathematics is the first book to apply categories to the most elementary mathematics. It thus serves two purposes: first, to provide a key to mathematics for the general reader or beginning student; and second, to furnish an easy introduction to categories for computer scientists, logicians, physicists, and linguists who want to gain some familiarity with the categorical method without initially committing themselves to extended study.

    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.

    But he did the devil's work. Thomas Thorpe hides his carnal desires under the mask of a pious lay preacher. When Ann Spencer rejects his advances, he evicts her from her home, claiming she is living in sin with a young man

    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. "

    Beginning with the background and very nature of probability theory, the book then proceeds through sample spaces, combinatorial analysis, fluctuations in coin tossing and random walks, the combination of events, types of distributions, Markov chains, stochastic processes, and more. The book's comprehensive approach provides a complete view of theory along with enlightening examples along the way.

    A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. The text contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

    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.

    The interviewers use the same questions year-after-year and here they are---with solutions! These questions come from all types of interviews (corporate finance, sales and trading, quant research, etc), but they are especially likely in quantitative capital markets job interviews. The questions come from all levels of interviews (undergrad, MBA, PhD), but they are especially likely if you have, or almost have, an MS or MBA. The latest edition includes over 120 non-quantitative actual interview questions, and a new section on interview technique---based partly on Dr. Crack's experiences interviewing candidates for the world's largest institutional asset manager. Dr. Crack has a PhD from MIT. He has won many teaching awards and has publications in the top academic, practitioner, and teaching journals in finance. He has degrees in Mathematics/Statistics, Finance, and Financial Economics and a diploma in Accounting/Finance. Dr. Crack taught at the university level for 20 years including four years as a front line teaching assistant for MBA students at MIT. He recently headed a quantitative active equity research team at the world's largest institutional money manager.

    This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.

    It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

    John Taylor has brought to his new book, Classical Mechanics, all of the clarity and insight that made his introduction to Error Analysis a best-selling text.

    It is intended to provide the essential primary texts for students of logic, metaphysics and philosophy of language.It contains, in particular, Frege's four essays 'Function and Concept', 'On Sinn and Bedeutung', 'On Concept and Object' and 'Thought', and new translations of key parts of the Begriffschrift, Grundlagen and Grundgesetze. Additional selections have also been made from his Collected Papers, Posthumous Writings and Correspondence. The editor's introduction provides an overview of the development and significance of Frege's philosophy, highlighting some of the main issues of interpretation. Footnotes, appendices and other editorial material have been supplied to facilitate understanding of the works of one of the central figures in modern philosophy.

    This is the currently used textbook for "Probabilistic Systems Analysis," an introductory probability course at the Massachusetts Institute of Technology, attended by a large number of undergraduate and graduate students. The book covers the fundamentals of probability theory (probabilistic models, discrete and continuous random variables, multiple random variables, and limit theorems), which are typically part of a first course on the subject. It also contains, a number of more advanced topics, from which an instructor can choose to match the goals of a particular course. These topics include transforms, sums of random variables, least squares estimation, the bivariate normal distribution, and a fairly detailed introduction to Bernoulli, Poisson, and Markov processes. The book strikes a balance between simplicity in exposition and sophistication in analytical reasoning. Some of the more mathematically rigorous analysis has been just intuitively explained in the text, but is developed in detail (at the level of advanced calculus) in the numerous solved theoretical problems. The book has been widely adopted for classroom use in introductory probability courses within the USA and abroad.