The question is how does the algorithm perform on average, what are the pathological cases and how slow are they?
How do you prove that with an algorithm that no human can reason about?
Basically this paper looks like they've found an algorithm which is efficient for given sets or given classes of sets. Whether that generalizes is a different problem.
It's basically a cool automatic heuristic generator.
Exactly, that’s what I thought. Although, they should be able to look at the set of instructions that generated the output, which is basically an algorithm in itself. Then they could try to prove whether that algorithm would really generalise.
How do you prove that with an algorithm that no human can reason about?
Basically this paper looks like they've found an algorithm which is efficient for given sets or given classes of sets. Whether that generalizes is a different problem.
It's basically a cool automatic heuristic generator.