Symbolic computation and teaching

  • Dana S. Scott
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1138)


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.


Boolean Function Cellular Automaton Projective Geometry Symbolic Computation Congruence Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dana S. Scott
    • 1
  1. 1.School of Computer ScienceCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations