×

Reasoning about the elementary functions of complex analysis. (English) Zbl 1042.68128

Campbell, John A. (ed.) et al., Artificial intelligence and symbolic computation. International conference AISC 2000, Madrid, Spain, July 17–19, 2000. Revised papers. Berlin: Springer (ISBN 3-540-42071-1). Lect. Notes Comput. Sci. 1930, 115-126 (2001).
Summary: There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the “unwinding number” approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. The unsolved problems are probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis.
For the entire collection see [Zbl 0961.00030].

MSC:

68W30 Symbolic computation and algebraic computation
33F10 Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.)
PDFBibTeX XMLCite
Full Text: Link