Java Bytecode Profiler

[Archie Cobbs]

Senthil Kumar writes:
> 3. upper bound to interpret it. This result is quite interesting

In general, it's is provably impossible to determine a (non-infinite)
upper bound on the running time of a method :-) Perhaps you mean
lower bound?

Example..

  public boolean PequalsNP() {
    for (int proof = 0; true; proof++) {
      if (IsAProofOf("P==NP", proof))
	return true;
    }
  }

-Archie

___________________________________________________________________________
Archie Cobbs   *   Whistle Communications, Inc.  *   http://www.whistle.com