I was bored and found a HP-27S

[Thomas Radtke]

(06-11-2014 01:08 PM)Thomas Klemm Wrote:  You should have a look at Message #60. But be warned: it's a "vulgar proof of Turing completeness".

I had:

Quote:Our goal is SUFFICIENT completeness, with finite number of steps and memory locations.

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 feel completely silly to argue with two experts of this forum :-D.

(1) Edited to insert this word

Edit 2: Yes, before someone mentions this - it might not be of any practical consequence, but that remains to show. I think you were about the same issue.