About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 404. Chapters: Denotational semantics, Domain theory, Formal methods, Logic in computer science, Mathematical software, Numerical analysis, Turing machine, Set theory, Lambda calculus, Polynomial, Probability, Fourier analysis, Peano axioms, Boolean satisfiability problem, Presburger arithmetic, Discrete Fourier transform, Fuzzy logic, Monte Carlo method, Horner scheme, Automated theorem proving, Basis function, Condition number, Iterative method, Combinational logic, Precondition, Trigonometric tables, Postcondition, Combinatory logic, Loss of significance, Vienna Development Method, Fixed point combinator, Numerical integration, Intuitionistic logic, HOL theorem prover family, Logic for Computable Functions, Well-posed problem, Liskov substitution principle, Algorithm characterizations, Algorithm examples, Curry-Howard correspondence, List of numerical analysis topics, UML state machine, Interval arithmetic, Biology Monte Carlo method, Chebyshev polynomials, Dynamic logic, Denotational semantics of the Actor model, Computational electromagnetics, Numerical continuation, Non-linear least squares, Butcher group, Predicate transformer semantics, Type-2 fuzzy sets and systems, Rewriting, Software development process, Movable cellular automaton, Karnaugh map, CORDIC, Numeric precision in Microsoft Excel, Jenkins-Traub algorithm, Affine arithmetic, Kahan summation algorithm, Sage, Difference quotient, Pade table, Nearest neighbor search, Levinson recursion, Propagation of uncertainty, Abstract rewriting system, Dependability, Race condition, Unbounded nondeterminism, Wolfram Alpha, Computation tree logic, Starmad, Relations between Fourier transforms and Fourier series, Intuitionistic type theory, Approximation theory, Wilkinson's polynomial, Discrete wavelet transform, IBM Rational Unified Process, Multigrid method, Actor model theo...
