Author: Robert Hyatt
Date: 15:30:13 11/01/03
Go up one level in this thread
On November 01, 2003 at 08:06:23, Tord Romstad wrote: >On October 31, 2003 at 10:27:00, Robert Hyatt wrote: > >>I don't know how you can possibly encode a loop into a complex expression, >>not knowing beforehand how many loop iterations will be needed... > >You can always use recursion instead of loops, as you surely already know. >Of course it would be terribly inefficient with a compiler that does not >support tail call eliminations, but theoretically it is always possible. > >Tord Recursion has branches. So we are back to a form of goto... IE a procedure call is most definitely a branch...
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.