Who knows? Answers to these questions might spur discussion on connections between cellular automata and other computational constructions. I think that's Wolfram's angle -- justify the cellular-automata-is-everything tack that he's been on the past 20-30 years.

These questions made me think of normal numbers [1] and their properties.

[1] https://en.wikipedia.org/wiki/Normal_number

From the detailed problem description:

"If one can show that a system is universal, however, then this does have implications that are closer to our rule 30 problem. In particular, if a system is universal, then there’ll be questions (like the halting problem) about its infinite-time behavior that will be undecidable, and which no guaranteed-finite-time computation can answer."

https://writings.stephenwolfram.com/2019/10/announcing-the-r...

Likely the development of new techniques for analyzing algorithms. But I don't really have a visceral understanding of the problem.