Proof, Completeness, Transcendentals, and Sampling
- 1 April 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 24 (2) , 298-310
- https://doi.org/10.1145/322003.322013
Abstract
This paper considers informally the relationship between computer aided mathematical proof, formal algebraic languages, computation with transcendental numbers, and proof by sampling.Keywords
This publication has 4 references indexed in Scilit:
- Fidelity in Mathematical Discourse: Is One and One Really Two?The American Mathematical Monthly, 1972
- Polynomial evaluation via the division algorithm the fast Fourier transform revisitedPublished by Association for Computing Machinery (ACM) ,1972
- Linear forms in the logarithms of algebraic numbersMathematika, 1966
- Complete sequences and approximations in normed linear spacesDuke Mathematical Journal, 1957