> Given more compute and enough recursiveness we should be able to reach any kind of result from the LLM.

That was always true for NNs in general, yet it took a very specific structure to get to where we are now. (..with a certain amount of time and resources.)

> thinking that computations in vector space are easy to make turing complete if we just have an eigenvector representation figured out

Sounds interesting, would you elaborate?