Symbolic mathematical computation in a Ph.D. Computer Science program
- 1 July 1972
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- No. 23,p. 25-28
- https://doi.org/10.1145/1093522.1093526
Abstract
Considering how many fools can calculate, it is surprising that it should be thought either a difficult or a tedious task for any other fool to learn how to master the same tricks....Being myself a remarkably stupid fellow,...[I] now beg to present to my fellow fools the parts that are not hard. Master these throughly and the rest will follow. What one fool can do, another can.Keywords
This publication has 4 references indexed in Scilit:
- A Simple Estimate for the Number of Steps in the Euclidean AlgorithmThe American Mathematical Monthly, 1971
- Modular arithmetic and finite field theoryPublished by Association for Computing Machinery (ACM) ,1971
- The number of steps in the Euclidean algorithmJournal of Number Theory, 1970
- A Subroutine for Computations with Rational NumbersJournal of the ACM, 1956