I was bored and found a HP-27S

[Katie Wasserman]

(06-10-2014 04:06 PM)Thomas Radtke Wrote:  

(06-10-2014 03:52 PM)Katie Wasserman Wrote:  Pretty amazing for a "non-programmable" calculator.

It is programmable, the solver is just not turing complete. Calculators like the 20S play in the same league, allthough not as obvious.

"not Turing Complete", I think not!

Since no calculator has an infinite memory you could say this about all of them. It's been a while since I was in grad school for this but I'm pretty sure that the solver can compute anything that a Turning machine can given enough memory. You might say that the solver has no ability to halt when looping, but it can simulate that.