3 ms·
I try to call it inductive programming whenever possible. Because that's what it is: a programmatic form of proof by induction. The analogy isn't exact (e.g. i
by Strilanc 10y ago
I try to call it inductive programming whenever possible. Because that's what it is: a programmatic form of proof by induction.
The analogy isn't exact (e.g. it could also refer to just recursion), but it's a lot more apt than "dynamic".
- StefanKarpinski 10y agoThat's a much better name – I may start using that. Viva la revolucion!
- aban 10y agoCool name! There was also a /r/compsci thread [0] a few months ago with some other interesting suggestions like "iterative recursion" and "divide-and-conquer with caching". [0]: https://www.reddit.com/r/compsci/comments/3u3520/if_you_could_rename_dynamic_programming_to/ https://www.reddit.com/r/compsci/comments/3u3520/if_you_coul...
- eru 10y agoAlas, the weight of history is against reason here.
- stillworks 10y agoOn first impression, the name appears to imply a Paradigm which was not the original intent I believe ? EDIT: "the name" referring to the original name i.e. Dynamic Programming. What you recommended is closer to what happens actually. I think I agree with people who call it "exhaustive search resulting in optimal solution where search space is generated incrementally in deterministic polynomial time" Hmm :-/... I guess I'll stick with the conventional acronym, sounds less daunting and even somewhat cool that way.
- jordigh 10y agoBut the "programming" part of "dynamic programming" is the older synonym for "optimisation" like in linear or quadratic programming, not for writing general computer programs. It's not the same kind of "programming" as in OOP or FP.
- AstralStorm 10y agoIn fact, many linear and quadratic programming problems are solved using dynamic programming. Go figure.
- deleted 10y ago[deleted]