On 05/08/2011 05:36 PM, Dan Stromberg wrote: > Just what is an inductive algorithm?
>From what I can remember, it's just an implementation of a proof essentially. Any algorithm that can be inductively proven can be implemented with recursion and specific base cases. In other words you program just like you'd do the proof. First you deal with the base cases and then you can call yourself for F(n) and F(n-1). The inductive proof provides the pattern for the code. -- http://mail.python.org/mailman/listinfo/python-list
