Heck, you can't even (in general) determine if a program will even terminate - how can you estimate the time until termination if you don't know if it will even terminate?
(Update: IMHO this is a nice example why it's good to have at least some scientific backing when you think about solving problems. Knowledge that it can't be solved in general prevents you either from wasting time, or helps you focusing on cases where it's feasible).
In reply to Re: Algorithm complexity
by moritz
in thread Algorithm complexity
by fauria
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |