Mathematics and computation /, Wigderson, Avi.

Автор: Barendregt
Название: Lambda Calculus with Types
ISBN: 0521766141 ISBN-13(EAN): 9780521766142
Издательство: Cambridge Academ
Рейтинг:
Цена: 85530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Typed lambda calculus is used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), which are used to design and verify IT products and mathematical proofs. This book reveals unexpected mathematical beauty in three classes of typing: simple types, recursive types and intersection types. Numerous exercises are provided.

Автор: Hinman
Название: Recursion-Theoretic Hierarchies
ISBN: 1107168244 ISBN-13(EAN): 9781107168244
Издательство: Cambridge Academ
Рейтинг:
Цена: 159450.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The theory set out in this volume is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. The author develops a general theory from which the results of both areas can be derived, making the common themes clear.

Автор: Petr Hajek
Название: Metamathematics of First-Order Arithmetic
ISBN: 1107168414 ISBN-13(EAN): 9781107168411
Издательство: Cambridge Academ
Рейтинг:
Цена: 111620.00 T
Наличие на складе: Есть
Описание: This much-needed monograph on the metamathematics of first-order arithmetic pays particular attention to subsystems (fragments) of Peano arithmetic and gives the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness.

Автор: Hesthaven, Jan S.
Название: Numerical methods for conservation laws
ISBN: 1611975093 ISBN-13(EAN): 9781611975093
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 0.00 T
Наличие на складе: Невозможна поставка.
Описание: Conservation laws are the mathematical expression of the principles of conservation and provide effective and accurate predictive models of our physical world. Although intense research activity during the last decades has led to substantial advances in the development of powerful computational methods for conservation laws, their solution remains a challenge and many questions are left open; thus it is an active and fruitful area of research. Numerical Methods for Conservation Laws: From Analysis to Algorithms:offers the first comprehensive introduction to modern computational methods and their analysis for hyperbolic conservation laws, building on intense research activities for more than four decades of development;discusses classic results on monotone and finite difference/finite volume schemes, but emphasizes the successful development of high-order accurate methods for hyperbolic conservation laws;addresses modern concepts of TVD and entropy stability, strongly stable Runge-Kutta schemes, and limiter-based methods before discussing essentially nonoscillatory schemes, discontinuous Galerkin methods, and spectral methods;explores algorithmic aspects of these methods, emphasizing one- and two-dimensional problems and the development and analysis of an extensive range of methods; includes MATLAB software with which all main methods and computational results in the book can be reproduced; anddemonstrates the performance of many methods on a set of benchmark problems to allow direct comparisons.Code and other supplemental material are available online at www.siam.org/books/cs18.

Автор: R?misch
Название: Mathematical Analysis and the Mathematics of Computation
ISBN: 3319427539 ISBN-13(EAN): 9783319427539
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book is a comprehensive, unifying introduction to the field of mathematical analysis and the mathematics of computing. It develops the relevant theory at a modern level and it directly relates modern mathematical ideas to their diverse applications.The authors develop the whole theory. Starting with a simple axiom system for the real numbers, they then lay the foundations, developing the theory, exemplifying where it's applicable, in turn motivating further development of the theory. They progress from sets, structures, and numbers to metric spaces, continuous functions in metric spaces, linear normed spaces and linear mappings; and then differential calculus and its applications, the integral calculus, the gamma function, and linear integral operators. They then present important aspects of approximation theory, including numerical integration. The remaining parts of the book are devoted to ordinary differential equations, the discretization of operator equations, and numerical solutions of ordinary differential equations.This textbook contains many exercises of varying degrees of difficulty, suitable for self-study, and at the end of each chapter the authors present more advanced problems that shed light on interesting features, suitable for classroom seminars or study groups. It will be valuable for undergraduate and graduate students in mathematics, computer science, and related fields such as engineering. This is a rich field that has experienced enormous development in recent decades, and the book will also act as a reference for graduate students and practitioners who require a deeper understanding of the methodologies, techniques, and foundations.

Автор: Fenstad
Название: General Recursion Theory
ISBN: 1107168163 ISBN-13(EAN): 9781107168169
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents a unified and coherent account of general recursion theory. The main core of the book gives an account of the general theory of computations, then the author moves on to show how computation theories connect and unify other parts of recursion theory.

Автор: Boissonnat Jean-Daniel
Название: Cambridge Texts in Applied Mathematics
ISBN: 1108410898 ISBN-13(EAN): 9781108410892
Издательство: Cambridge Academ
Рейтинг:
Цена: 40130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers a rigorous introduction to geometric and topological inference, a rapidly evolving field that intersects computational geometry, applied topology, and data analysis. It can serve as a textbook for graduate students or researchers in mathematics, computer science and engineering interested in a geometric approach to data science.

Автор: Iserles
Название: Acta Numerica 2016
ISBN: 1107168058 ISBN-13(EAN): 9781107168053
Издательство: Cambridge Academ
Рейтинг:
Цена: 174240.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Acta Numerica is an annual publication containing invited survey papers by leading researchers in numerical mathematics and scientific computing. The papers present overviews of recent developments in their area and provide state-of-the-art techniques and analysis.

Автор: Harald Niederreiter, Alina Ostafe, Daniel Panario,
Название: Algebraic Curves and Finite Fields: Cryptography and Other Applications
ISBN: 3110317885 ISBN-13(EAN): 9783110317886
Издательство: Walter de Gruyter
Цена: 173490.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algebra and number theory have always been counted among the most beautiful and fundamental mathematical areas with deep proofs and elegant results. However, for a long time they were not considered of any substantial importance for real-life applications. This has dramatically changed with the appearance of new topics such as modern cryptography, coding theory, and wireless communication. Nowadays we find applications of algebra and number theory frequently in our daily life. We mention security and error detection for internet banking, check digit systems and the bar code, GPS and radar systems, pricing options at a stock market, and noise suppression on mobile phones as most common examples. This book collects the results of the workshops "Applications of algebraic curves" and "Applications of finite fields" of the RICAM Special Semester 2013. These workshops brought together the most prominent researchers in the area of finite fields and their applications around the world. They address old and new problems on curves and other aspects of finite fields, with emphasis on their diverse applications to many areas of pure and applied mathematics.

Автор: Thomas Pfaff
Название: R For College Mathematics and Statistics
ISBN: 0367196859 ISBN-13(EAN): 9780367196851
Издательство: Taylor&Francis
Рейтинг:
Цена: 93910.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: R can be used consistently in the college mathematics classroom. We no longer have to limit ourselves to ``nice`` functions in calculus classes. We can require reports and homework with graphs. We can do simulations and experiments. R can be useful for student projects, for creating graphics for teaching, as well as for scholarly work.

Автор: Oikkonen
Название: Logic Colloquium `90
ISBN: 110716902X ISBN-13(EAN): 9781107169029
Издательство: Cambridge Academ
Рейтинг:
Цена: 116160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in July 1990, containing eighteen papers written by leading researchers in logic. Between them they cover all fields of mathematical logic, including model theory, proof theory, recursion theory, and set theory.

Автор: Meir Reshef
Название: Strategic Voting
ISBN: 1681733595 ISBN-13(EAN): 9781681733593
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 66530.00 T
Наличие на складе: Невозможна поставка.
Описание: Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting.There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science.The book has two parts. The first part asks ""are there voting rules that are truthful?"" in the sense that all voters have an incentive to report their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users.In the second part, we ask ""what would be the outcome when voters do vote strategically?"" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare.We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.