And again, doing this--now this is some computationally expensive proposition--and doing this with classical [INDlSTlNCT] like--probably familiar with gradient descent or simulated annealing or genetic algorithms; they are essentially all flavors of gradient descent and they're all bound in some way or the other to get stuck in a local minimum because there's this fundamental limitation. 