Symbolic computation and teaching
Since 1989, the author has tried to show that it is possible to put a complete semester-long course in machine-held form. Several examples have been carried out (in Mathematica), and the paper reports on the experience, on the problems encountered, and on some suggestions for future developments.
KeywordsBoolean Function Cellular Automaton Projective Geometry Symbolic Computation Congruence Relation
Unable to display preview. Download preview PDF.