Anonymous user
User:Realazthat/Projects wishlist/LLVM/Algorithm Synthesis: Difference between revisions
User:Realazthat/Projects wishlist/LLVM/Algorithm Synthesis (view source)
Revision as of 05:44, 26 November 2010
, 13 years agono edit summary
No edit summary |
No edit summary |
||
Line 22:
Notes:
* '''w''' should probably be calculated, or compared asymptotically.
* There should be a memory constraint as well, as a huge constant array with precomputed results will probably yeild the lowest '''w'''. The memory should probably be constrained to a constant times the size of the input, again, asymptotically.
* For the weight, one would probably give each instruction a weight, then sum up the weights during execution. Or, use a decidable language, and compute the complexity by counting loops etc. if possible.
References:
| |||