They slip, they slide, they're considered obsolete, but they don't need batteries, and are unaffected by computer viruses...
Dover publishes a lot of older math texts that are no longer being published by the "first string" publishers such as Addison Wesley, Prentice Hall, and Springer Verlag. As a result, the Dover texts are not new. There are a lot of texts from the 1950s and 1960s. Of course, many of the mathematical principles known then are still relevant today, and I've run through some of these "old texts" and found that they bore remarkable resemblance to the vastly-more-expensive texts I studied from in university.
This is a Calculus textbook that is distributed under the terms of the GPL.
Fundamental Problems in Algorithmic Algebra (including Continued Fractions!)
On numerical analysis and round-off errors
Plans to be a "data analysis" system that might be reminiscent of SAS, combining:
A symbolic math system written in Common Lisp based on MACSYMA.
A Scheme-based algebra package.
GiNaC is Not a CAS (Computer Algebra System) - Plans to replace Maple in some applications
Including a critique of Mathematica...
XLOOPS - program that uses Maple to calculate Feynman diagrams
To the user, this somewhat resembles Mathematica, but has the advantage of being totally open (full source code). One can manipulate polynomials in several variables over the integers, rational functions, and a variety of other mathematical objects. Manipulations include simplification, differentiation, integration, evaluation, pattern matching, etc. Written in Common Lisp
A = B - on Computer Algebra
This is the study of the strategy of conflicts; it was formalized in the analysis of strategies for nuclear war, but the analysis can be used to frame a wide scope of issues.
The common problems of Game Theory include The Prisoners' Dilemna and Zero sum games. Much contention arises over what sum a particular "game" comes to...
In 1948 and 1949 Kenneth J. Arrow conducted research on the theory of social choice (group decision making or voting). He investigated the possibility of a method of voting which would embody the following desirable features:
The voting method should provide a complete ranking of all alternatives from any set of individual preference ballots.
If one set of preference ballots preference ballots would lead to an an overall ranking of alternative X above alternative Y and if some preference ballots are changed in such a way that the only alternative that has a higher ranking on any preference ballots is X, then the method should still rank X above Y.
Criterion of independence of irrelevant alternatives.
If one set of preference ballots would lead to an an overall ranking of alternative X above alternative Y and if some preference ballots are changed without changing the relative rank of X and Y, then the method should still rank X above Y.
Every possible ranking of alternatives can be achieved from some set of individual preference ballots.
There should not be one specific voter whose preference ballot is always adopted.
Arrow concluded that it is not possible to have a voting method with all of these properties. The conditions are mutually contradictory.
More simply put, there is no consistent method of making a fair choice among three or more candidates. This result assures us that there is no single election procedure that can always fairly decide the outcome of an election that involves more than two candidates or alternatives.
The impact of this theorem is that people find themselves, whether from perspectives of moral obligation or reasonableness, wanting things that are downright impossible.
In 1972 Arrow won the Nobel Prize in economics for his many contributions to that field, including this theorem.
Perhaps of somewhat nominal connection; pricing of products is a big, hairy, complex problem. There's a lot of " Prisoner's Dilemma" to it, and actually understanding why it is so troublesome likely requires some mathematical sophistication...