tail recursion

[harrison@sp21.csrd.uiuc.edu (Luddy Harrison)]

>>   for every program state P,
>>      if continued execution eventually causes state P to recur,
>>         and every non-tail-recursive evaluation begun since
>>             the first occurrence of state P has completed
>>             before the second occurrence of state P
>>      then state P will recur indefinitely many times without
>>	 running out of resources

This is a wonderful definition.  It appears, however, to have a hole
through which a tricky implementation would be entitled to jump.  It
would permit me to be very consumptive of resources, could I
demonstrate that the repitition of states was impossible for an input
program.

-Luddy