|
|
|
| "be consistent" | |
| PerlMonks |
Re: Algorithm complexityby JavaFan (Canon) |
| on Jul 07, 2009 at 23:42 UTC ( [id://778074]=note: print w/replies, xml ) | Need Help?? |
|
Considering it's even impossible to write a program that determines whether another program terminates (Halting Problem), no such tool exists.
In general, not even humans can, or can only proof upper bounds which aren't tight (or not known whether the bounds are tight).
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||