摘要: Suppose you want to find the solution S a mathematical problem in some domain. Depending upon type of operations under consideration that lead construction S, one can distinguish between "pure mathematics" (which uses tools such as infinite union, limits, etc.) and "algorithmic (whose are substitution, if-then-else, recursion, etc.). Algorithmic mathematics is interested only those solutions be expressed by constructs whose effects realized (idealized) machines. Hence, essence algorithmic solving hinges on realization "relative" given "black box" (i.e. idealized machine) operations.
acm.org 参考文章(9)
B. Buchberger, Mathematica: doing mathematics by computer? Texts and Monographs in Symbolic Computation. pp. 2- 20 ,(1997) , 10.1007/978-3-7091-6531-7_1
Bruno Buchberger, Symbolic Computation: Computer Algebra and Logic frontiers of combining systems. pp. 193- 219 ,(1996) , 10.1007/978-94-009-0349-4_10
George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages. pp. 134- 183 ,(1975)
George E. Andrews, Applications of Basic Hypergeometric Functions Siam Review. ,vol. 16, pp. 441- 484 ,(1974) , 10.1137/1016081
B. Buchberger, Greobner Bases : an algorithmic method in polynomial ideal theory Multidimensional Systems Theory. pp. 184- 232 ,(1985)
István Nemes, Marko Petkovšek, Herbert S. Wilf, Doron Zeilberger, How to do monthly problems with your computer American Mathematical Monthly. ,vol. 104, pp. 505- 519 ,(1997) , 10.1080/00029890.1997.11990673
Doron Zeilberger, The method of creative telescoping Journal of Symbolic Computation. ,vol. 11, pp. 195- 204 ,(1991) , 10.1016/S0747-7171(08)80044-2
R. W. Gosper, Decision procedure for indefinite hypergeometric summation Proceedings of the National Academy of Sciences of the United States of America. ,vol. 75, pp. 40- 42 ,(1978) , 10.1073/PNAS.75.1.40
Donald Ervin Knuth, The Art of Computer Programming ,(1968)