This then lead to Hilbert's 10th problem - finding an algorithm of solving Diophantine in a fixed number of steps to whole numbers. Interestingly enough - Diophantine sets are Turing Machines. (That last one kind of blows my mind).
Now the Entscheidungsproblem (or as we know it the halting problem) has a relationship to Computer Algebra - but was more about the decidability rather than the symbolic mathematics. Can we say Macsyma was directed at both the symbolic mathematics and the halting problem?
My question is: Is there evidence to suggest Macsyma was directed at the Diophantine equations in the Entscheidungsproblem?