Hello, I integrated Sympy into the learning system which is meant for "replacing the pencil and paper that students would ordinarily use to solve math homework problems." In this system a student is expected to enter full solution of the problem, step by step.
I use Sympy to compare expressions, entered by student (exp1), with expressions stored for the possible solutions of the task being solved (exp2). Roughly it's like that: if simplify(exp1 - exp2) == 0, then student entered a correct step. My science advisor wonders about the simplification procedure in Sympy. He says - how come, the problem of simplification is algorithmically unsolvable, how it works? So, the question is: - Can the procedure of expression simplification be described this way - http://cane.yuntech.edu.tw/member/WRC2004/Computer%20Algebra%20Papers/Understanding%20Expression%20Simplification.pdf - part 5.2. "Implementations"? - Is there any data about how often simplification of expressions doesn't work? How can "the class of expressions" - for which simplification in Sympy is done well - be described? -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
