Abstract
We use algebraic field extension theory to find self-correctors for a broad class of functions. Many functions whose translations are contained in a function field that is a finite degree extension of a scalar field satisfy polynomial identities that can be transformed into self-correctors. These functions can be efficiently corrected in a way that is simpler and different from how the functions are actually computed. This is an essential feature of program self-correcting. Among the functions for which we present self-correctors are many rational expressions of x,e x, and sin(x) (over the real and complex fields) as weD as many rational expressions of x, g x (g a generator) mapping the integers into a finite field and many rational expressions of x,log h (x) (h a generator) mapping a finite field into the reals.
The new tools presented in this extended abstract will be useful to the theory of program self testing/correcting. Furthermore, they may yield new results in complexity theory. Previous work in the self-testing of polynomials had important applications in the PCP protocols that proved the hardness of approximating max-SNP problems.
Supported by NSF grant CCR-9201092.
Part of this work was done while visiting the International Computer Science Institute, Berkeley, CA 94704. Partially supported by the ESPRIT B.R.A. Project 9072 GEPPCOM.
Part of this work was performed at Sandia National Laboratories and was supported by the U.S. Department of Energy under contract DE-AC04-76DP00789; part of the work was done while at UC Berkeley supported by NSF grant number CCR-9201092.
Supported by a Fannie and John Hertz Foundation fellowship.
Preview
Unable to display preview. Download preview PDF.
References
S. Ar, M. Blum, B. Codenotti, P. Gemmell. Checking Approximate Computations over the Reals. Proc. 25st ACM Symposium on Theory of Computing, 1993.
M. Blum. Designing Programs to Check their Work. ICSI TR-88-009, 1988.
M. Blum, S. Kannan. Designing Programs that Check their Work. In Proc. 21st ACM Symposium on Theory of Computing, 1989.
M. Blum, M. Luby, R. Rubinfeld, “Self-Testing/Correcting with Applications to Numerical Problems,” Proc. 22nd ACM Symposium on Theory of Computing, 1990.
P. Gemmell, R. Lipton, M. Sudan, R. Rubinfeld, A. Widgerson. Self-Testing/Correcting for Polynomials and for Approximate Functions. Proc. 23rd ACM Symposium on Theory of Computing, 1991.
P. Gemmell, M. Sudan. Highly Resilient Correctors for Polynomials. Information Processing Letters, 28 Sept. 1992, vol. 43 (no 4): 169–174
S. Lang. Algebra. Addison-Wesley Pu. Co., 1965.
R. Lipton. “New directions in testing”, in Distributed Computing and Cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, American Mathematical Society, 1991.
R. Rubinfeld. A mathematical theory of Self-Checking, Self-Testing, and Self-Correcting Programs. PhD Thesis, UC Berkeley, and ICSI TR-90-054, 1990.
R. Rubinfeld. Robust Functional Equations with Applications to Self-Testing/Correcting. Proc. 35th IEEE FOCS, 1994.
F. Vainstein. Error Detection and Correction in Numerical Computation by Algebraic Methods. Lecture Notes in Computer Science, 539, Springer Verlag, 1991, pp.456–464.
F. Vainstein. Algebraic Methods in Hardware/Software Testing. Ph.D. Thesis, Boston University Graduate School, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blum, M., Codenotti, B., Gemmell, P., Shahoumian, T. (1995). Self-correcting for function fields of finite transcendental degree. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_104
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive