I mean, it's basically what out-of-order CPUs already do: read lots of instructions in at the same time, dispatch instructions as their inputs become ready to execute.
Sort of the reality of modern processors is that we have the units available to do the work, we just don't have dispatch logic to keep them fed with work, given how slow memory is. When you have very regular parallelism--dense linear algebra is the canonical example here--SIMD works very efficiently to minimize the dispatch logic needed to keep units fed. When you've got irregular parallelism, dataflow architectures seem to work well at first, until you start trying to make actual chips and you find you've been consistently underestimating how much overhead your dispatch logic is actually chewing up.
If it is true that what is offering is some kind of "super-simd" processor that is built in a way that everything run through it must be similar to simd style code, but because it's hardware, it will run it much faster, then my questions are definitely targeted toward what the speed up is vs a highly-performant SIMD application. I would hope that their "coming next" stuff includes comparisons against the types of SIMD-boosted dense linear algebra you referenced. What is the speed up compared to that. And if it's less than (arbitrarily, say) 10x, how much can be gained by just having an LLM target breaking more stuff down in to multiplex-able instructions? But then, if it's more than that, my questions start turning towards "how much would it take to prototype" and "how much has to be changed from current tooling to produce the chips at scale" and "what is a good showcase target for an initial run? what would be something that could be made actually (in real dollars/hours) cheaper/faster/better by using this chip?"
if it is, that has been tried before and failed (with itanium/etc), because the optimization burden on compilers means that they never end up getting the projected speeds over conventional execution