Дискретная математика. Теория и практика решения задач по информатике. Учебное пособие

Theory of Preliminary Test and Stein-Type Estimation with Applications provides a com-prehensive account of the theory and methods of estimation in a variety of standard models used in applied statistical inference. It is an in-depth introduction to the estimation theory for graduate students, practitioners, and researchers in various fields, such as statistics, engineering, social sciences, and medical sciences. Coverage of the material is designed as a first step in improving the estimates before applying full Bayesian methodology, while problems at the end of each chapter enlarge the scope of the applications. This book contains clear and detailed coverage of basic terminology related to various topics, including: * Simple linear model; ANOVA; parallelism model; multiple regression model with non-stochastic and stochastic constraints; regression with autocorrelated errors; ridge regression; and multivariate and discrete data models * Normal, non-normal, and nonparametric theory of estimation * Bayes and empirical Bayes methods * R-estimation and U-statistics * Confidence set estimation

Learn the skills and acquire the intuition to assess the theoretical limitations of computer programming Offering an accessible approach to the topic, Theory of Computation focuses on the metatheory of computing and the theoretical boundaries between what various computational models can do and not do—from the most general model, the URM (Unbounded Register Machines), to the finite automaton. A wealth of programming-like examples and easy-to-follow explanations build the general theory gradually, which guides readers through the modeling and mathematical analysis of computational phenomena and provides insights on what makes things tick and also what restrains the ability of computational processes. Recognizing the importance of acquired practical experience, the book begins with the metatheory of general purpose computer programs, using URMs as a straightforward, technology-independent model of modern high-level programming languages while also exploring the restrictions of the URM language. Once readers gain an understanding of computability theory—including the primitive recursive functions—the author presents automata and languages, covering the regular and context-free languages as well as the machines that recognize these languages. Several advanced topics such as reducibilities, the recursion theorem, complexity theory, and Cook's theorem are also discussed. Features of the book include: A review of basic discrete mathematics, covering logic and induction while omitting specialized combinatorial topics A thorough development of the modeling and mathematical analysis of computational phenomena, providing a solid foundation of un-computability The connection between un-computability and un-provability: G?del's first incompleteness theorem The book provides numerous examples of specific URMs as well as other programming languages including Loop Programs, FA (Deterministic Finite Automata), NFA (Nondeterministic Finite Automata), and PDA (Pushdown Automata). Exercises at the end of each chapter allow readers to test their comprehension of the presented material, and an extensive bibliography suggests resources for further study. Assuming only a basic understanding of general computer programming and discrete mathematics, Theory of Computation serves as a valuable book for courses on theory of computation at the upper-undergraduate level. The book also serves as an excellent resource for programmers and computing professionals wishing to understand the theoretical limitations of their craft.

An exciting approach to the history and mathematics of number theory “. . . the author’s style is totally lucid and very easy to read . . .the result is indeed a wonderful story.” —Mathematical Reviews Written in a unique and accessible style for readers of varied mathematical backgrounds, the Second Edition of Primes of the Form p = x2+ ny2 details the history behind how Pierre de Fermat’s work ultimately gave birth to quadratic reciprocity and the genus theory of quadratic forms. The book also illustrates how results of Euler and Gauss can be fully understood only in the context of class field theory, and in addition, explores a selection of the magnificent formulas of complex multiplication. Primes of the Form p = x2 + ny2, Second Edition focuses on addressing the question of when a prime p is of the form x2 + ny2, which serves as the basis for further discussion of various mathematical topics. This updated edition has several new notable features, including: • A well-motivated introduction to the classical formulation of class field theory • Illustrations of explicit numerical examples to demonstrate the power of basic theorems in various situations • An elementary treatment of quadratic forms and genus theory • Simultaneous treatment of elementary and advanced aspects of number theory • New coverage of the Shimura reciprocity law and a selection of recent work in an updated bibliography Primes of the Form p = x2 + ny2, Second Edition is both a useful reference for number theory theorists and an excellent text for undergraduate and graduate-level courses in number and Galois theory.