Re: deductive databases

Quoth "ken quirici" <kquirici_at_yahoo.com>:
> AFAIK there is no algorithm using recursion that can't be 'emulated'
> by one not using recursion.

Ackermann's function may be an exception; there do exist some fundamentally recursive expressions where "emulation" doesn't work out well.

The normal alternative to recursion is merely to hide it by the use of a stack. (FORTRAN folk know this well, as FORTRAN was very recursion-unfriendly until quite recently.)

And while recursion is an abstraction that can cause confusion to those new to it, the ways of hiding it tends to lead to code that is more opaque than straightforward recursion would have been.

-- 
(format nil "~S@~S" "cbbrowne" "gmail.com")
http://linuxdatabases.info/info/finances.html
Rules of the  Evil Overlord #3. "My noble  half-brother whose throne I
usurped will be killed, not kept anonymously imprisoned in a forgotten
cell of my dungeon." <http://www.eviloverlord.com/>