[samstave]

I am going to ask a question from a very naive POV, 5 yo:

ELI5 the following please ;

---

Given that "enormous constants" are required (i.e. huge lee-way) in the source of inputs (if thats worded correctly), Would it be perceivable, that in future, we may feed such zygote algorithms to some other AI/ML/Algo/Whatever, such that it churns through implementation scenarios quickly to refine it to a practical tool?

[qsort]

I don't think the problem is that we can't develop a practical implementation, it's that the constant being hidden by the asymptotic notation is inherently huge, making the algorithm impractical given the input sizes we are interested in.

There are a lot of problems where this shows up, notably testing primality (we can do that in poly time but it's O(n^6) or something iirc) and matrix multiplication (Strassen's algo).

[samstave]

At what point are we looking at the inter-relationships and commonalities among all practical implementations which share common input [groups, types, {trait}], etc...