Open conjecture

Assume an algorithm exists which takes an initial mapping matrix as
input, and spits out the infinite-limit mapping matrix, to whatever
arbitrary limit cutoff is desired, that is the lowest-logflat-badness
extension of the initial matrix.

Is it possible for such an algorithm to be in polynomial time?

Bonus: if you change "logflat badness" to "cangwu badness" instead,
then is it possible? How about TE badness?

-Mike

I'll follow it up with a stronger conjecture: is it possible for such
an algorithm to be in linear time or constant time?

-Mike

On Thu, Mar 22, 2012 at 11:43 PM, Mike Battaglia <battaglia01@gmail.com> wrote:
> Assume an algorithm exists which takes an initial mapping matrix as
> input, and spits out the infinite-limit mapping matrix, to whatever
> arbitrary limit cutoff is desired, that is the lowest-logflat-badness
> extension of the initial matrix.
>
> Is it possible for such an algorithm to be in polynomial time?
>
> Bonus: if you change "logflat badness" to "cangwu badness" instead,
> then is it possible? How about TE badness?
>
> -Mike