I was bored and found a HP-27S

[Dave Britten]

(06-11-2014 02:34 PM)Thomas Radtke Wrote:  I'm still missing either the possibility of an infinite run within the solver or its exclusion in the above definition of a "vulgar proof". I can predict that any program eventually stops, and not only because batteries are empty or the hardware dies. I don't think the definition of a *sufficient*(1) turing completeness is met here.

I think it just depends on if you're talking computer science or computer engineering.

I'm the former, but since Turing completeness also has to assume essentially unlimited working memory and run time, I'm willing to make this affordance as well.

Horse shoes, hand grenades, and Turing completeness.