Вычислительная математика
Математика
  • формат pdf
  • размер 1.96 МБ
  • добавлен 02 октября 2011 г.
Enderton H.B. Computability Theory: An Introduction to Recursion Theory
Academic Press, 2010. - 192 pages.

Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way.

Frequent historical information presented throughout More extensive motivation for each of the topics than other texts currently available Connects with topics not included in other textbooks, such as complexity theory
Похожие разделы
Смотрите также

Журнальные обзоры по вычислительной теории групп

  • формат pdf
  • размер 348.68 КБ
  • добавлен 17 августа 2010 г.
Два обзора по теории вычислителных групп на английском языке. Авторы обзоров Sims Ch. Computational group theory (1998)-30 p Seress A. An introduction to computational group theory(1999)-30p

Beck M., Robins S. Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra

  • формат pdf
  • размер 3.07 МБ
  • добавлен 08 января 2011 г.
Springer, 2007. - 226 pages. This much-anticipated textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. Because there is no other book that puts together all of these ideas in one place, this text is truly a service to the mathematical commun...

Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation

  • формат djvu
  • размер 9.8 МБ
  • добавлен 08 сентября 2011 г.
Springer, 1998. - 453 Pages. The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of comput...

Burden R.L., Faires J.D. Numerical Analysis

  • формат pdf
  • размер 14.53 МБ
  • добавлен 16 августа 2011 г.
Brook Cole, 2010. - 888 pages. This well-respected text gives an introduction to the theory and application of modern numerical approximation techniques for students taking a one- or two-semester course in numerical analysis. With an accessible treatment that only requires a calculus prerequisite, Burden and Faires explain how, why, and when approximation techniques can be expected to work, and why, in some situations, they fail. A wealth of ex...

Christensen O., Christensen K.L. Approximation Theory: From Taylor Polynomials to Wavelets

  • формат djvu
  • размер 6.19 МБ
  • добавлен 19 февраля 2011 г.
Birkh?user Boston, 2004. - 165 Pages. This concisely written book gives an elementary introduction to a classical area of mathematics --approximation theory -- in a way that naturally leads to the modern field of wavelets. The exposition, driven by ideas rather than technical details and proofs, demonstrates the dynamic nature of mathematics and the influence of classical disciplines on many areas of modern mathematics and applications.

Chu M.T., Golub G.H. Inverse Eigenvalue Problems: Theory, Algorithms, and Applications

  • формат pdf
  • размер 7.43 МБ
  • добавлен 12 декабря 2010 г.
Oxford University Press, USA, 2005. - 406 pages. Inverse eigenvalue problems arise in a remarkable variety of applications and associated with any inverse eigenvalue problem are two fundamental questions-the theoretic issue on solvability and the practical issue on computability. Both questions are difficult and challenging. In this text, the authors discuss the fundamental questions, some known results, many applications, mathematical propertie...

Deturck D., Wilf H.S. Lectures on Numerical Analysis

  • формат pdf
  • размер 632.37 КБ
  • добавлен 30 января 2012 г.
Department of Mathematics University of Pennsylvania, 2002. - 124 pages. Differential and Difference Equations. Introduction. Linear equations with constant coefficients. Difference equations. Computing with difference equations. Stability theory. Stability theory of difference equations. The Numerical Solution of Differential Equations. Euler's method. Software notes. Systems and equations of higher order. How to document a program. The midpoin...

Knabner P., Angerman L. Numerical Methods for Elliptic and Parabolic Partial Differential Equations

  • формат pdf
  • размер 2.4 МБ
  • добавлен 12 декабря 2010 г.
Springer, 2003. - 415 pages. This text provides an application oriented introduction to the numerical methods for partial differential equations. It covers finite difference, finite element and finite volume methods, interweaving theory and applications throughout. Extensive exercises are provided throughout the text. Graduate students in mathematics, engineering and physics will find this book useful.

Weihrauch K. Computable Analysis: An Introduction

  • формат djvu
  • размер 2.39 МБ
  • добавлен 30 марта 2011 г.
Springer, 2000. - 285 pages. Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and...

Wilcox C.H. (editor) Asymptotic Solutions of Differential Equations and Their Applications

  • формат djvu
  • размер 1.78 МБ
  • добавлен 07 мая 2011 г.
John Wiley & Sons, 1964. - 257 Pages. Asymptotic solutions of differential equations are an important tool in applied mathematics and theoretical physics, with applications to such diverse fields as boundary layer theory in fluid dynamics, diffraction theory in optics, the theory of thin shells in elasticity, nonlinear oscillations in electrical networks, and quantum mechanics. The theory of asymptotic solutions was initiated by H. Poincar...