I was just wondering. Is there a computational problem P for which there is no asymptotically least-time solution?(adsbygoogle = window.adsbygoogle || []).push({});

In other words: let x be an algorithm which is a solution to P. Denote by T(x), the worst-case runtime of x as a function of its input size. Is it possible that for any algorithm x that solves P, there exists an algorithm y that solves P, where T(y) = o(T(x))?

o is little-o notation, so in other words that would mean T(y) = O(T(x)) and T(y) is not Θ(T(x)).

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# No Minimum-Time Algorithm?

Loading...

Similar Threads for Minimum Algorithm |
---|

A Pairing algorithm |

B Least / Smallest / Minimum Detectable Difference |

B Bellman's and Bellman-Ford algorithm |

I Dijkstra's algorithm spp |

**Physics Forums | Science Articles, Homework Help, Discussion**