Revision as of 17:46, 14 January 2006 edit XaosBits (talk \| contribs) 490 edits m →Constant undecidability ← Previous edit		Revision as of 21:57, 14 January 2006 edit undo XaosBits (talk \| contribs) 490 edits m →Constant undecidability Next edit →
Line 29: :Now that [[User:Baccala@freesoft.org\|Baccala@freesoft.org]] mentions it, it does make sense. I wrote that line in because I remember reading it in one of the introductory articles on computer algebra, but I have never read Richardson's result. These things can be tricky, and given that I am not a professional in computer algebra, I agree with the removal. [[User:XaosBits\|XaosBits]] 17:46, 14 January 2006 (UTC) : I found the reference. It's from Moses (of [[Macsyma]] fame) paper, ''Symbolic integration: the stormy decade'', in Communications of the ACM, volume 14. The quote about deciding if an expression is zero in on page 557. [[User:XaosBits\|XaosBits]]

Talk:Risch algorithm: Difference between revisions