On the problem of recognizing zero

  • Authors:
  • S. C. Johnson

  • Affiliations:
  • -

  • Venue:
  • SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of recognizing when a complicated mathematical expression equals zero has great importance in symbolic mathematics. This paper gives two algorithms which can be applied to many such problems, and discusses two concrete examples. The algorithms are based on the recognition that many interesting functions (such as exponentiation) are eigenvectors of well studied transformations (such as differentiation).