Zero Tests for Constants in Simple Scientific Computation

@article{Richardson2007ZeroTF,
  title={Zero Tests for Constants in Simple Scientific Computation},
  author={Daniel Richardson},
  journal={Mathematics in Computer Science},
  year={2007},
  volume={1},
  pages={21-37}
}
It would be desirable to have an algorithm to decide equality among the constants which commonly occur in scientific computing. We do not yet know whether or not this is possible. It is known, however, that if the Schanuel conjecture is true, then equality is Turing decidable among the closed form numbers, that is, the complex numbers built up from the rationals using field operations, radicals, exponentials and logarithms. An algorithm based on the Schanuel conjecture is described in this… CONTINUE READING

From This Paper

Topics from this paper.
9 Citations
23 References
Similar Papers

Similar Papers

Loading similar papers…