But we haven't really answered the important question yet: Is genAI turing complete?

[karolherbst@chaos.social]

But we haven't really answered the important question yet: Is genAI turing complete?

[karolherbst@chaos.social]

I'm sure this question will keep scholars around the world awake all night

[pac85@social.treehouse.systems]

@karolherbst It doesn't take much to be turing complete and I'd be surprised if they weren't honestly.

[karolherbst@chaos.social]

@pac85 I honestly kinda doubt they'd qualify

[pac85@social.treehouse.systems]

@karolherbst why? Think of the embedding space as the memory strip and attention/matrix multiplication in general as being able to index and compute a function on it to get the next state. the only thing you need is some feedback to make sure you can keep the computation going indefinitely (which LLMs have).

[karolherbst@chaos.social]

@pac85 sure, but the result also has to be accurate

[pac85@social.treehouse.systems]

@karolherbst You can probably fairly trivially show that you can construct a neural net that can accurately and deterministically advance the state machine of a cpu and keep track of memory at the same time. As for current LLMs, they may not be 100% accurate but I'd be suprised if the following wouldn't work:
send an asm snippet toghether with text encoding cpu state and memory and ask it to advanve that sate.
It can probably do it fairly reliably. And yeah may not be 100% reliable (though it might also be) but I wouldn't write it off as not being turing complete for that (just like real machines are susceptible to noise) as it has little relevance practically.

[karolherbst@chaos.social]

We all in 10 days