Proof, Completeness, Transcendentals, and Sampling

Authors:
Philip J. Davis
Affiliations:
Department of Applied Mathematics, Brown University, Providence, RI
Venue:
Journal of the ACM (JACM)
Year:
1977

Citing 1
Cited 2

Polynomial evaluation via the division algorithm the fast Fourier transform revisited

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
On the Use of Transcendentals for Program Testing

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers informally the relationship between computer aided mathematical proof, formal algebraic languages, computation with transcendental numbers, and proof by sampling.