- 1 J. McCARTHY, Programs with common sense, Paper presented at the Symposium on the Mechanization of Thought Processes, National Physical Laboratory, Teddington, England, Nov. 24-27, 1958. (Published in Proceedings of the Symposium by H. M. Stationery Office).Google Scholar
- 2 A. NEWELL AND J. C. SHAW, Programming the logic theory machine, Proc. Western Joint Computer Conference, Feb. 1957.Google Scholar
- 3 A. CmmcH, The Calculi of Lambda-Conversion (Princeton University Press, Princeton, N. J., 1941).Google Scholar
- 4 FORTRAN Programmer's Reference Manual, IBM Corporation, New York, Oct. 15, 1956.Google Scholar
- 5 A. J. PERLIS AND K. SAME, LSON, International algebraic language, Preliminary Report, Comm. Assoc. Comp. Mach., Dec. 1958. Google ScholarDigital Library
Index Terms
- Recursive functions of symbolic expressions and their computation by machine, Part I
Recommendations
A combined symbolic and numerical algorithm for the computation of zeros of orthogonal polynomials and special functions
Special issue: Algebra and computer analysisA Maple algorithm for the computation of the zeros of orthogonal polynomials (OPs) and special functions (SFs) in a given interval [ x 1 , x 2 ] is presented. The program combines symbolic and numerical calculations and it is based on fixed point ...
Symbolic summation with radical expressions
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computationAn extension of Karr's summation algorithm is presented by which symbolic sums involving radical expressions can be simplified. We discuss the construction of appropriate difference fields as well as algorithms for solving difference equations in these ...
Stable regions of Turán expressions
Consider polynomial sequences that satisfy a first-order differential recurrence. We prove that if the recurrence is of a special form, then the Turán expressions for the sequence are weakly Hurwitz stable (non-zero in the open right half-plane). A ...
Comments