logoalt Hacker News

suddenlybananasyesterday at 10:22 PM1 replyview on HN

I don't really see the relationship to your comment and the paper's content. Could you elaborate a little?


Replies

dfabulichyesterday at 10:34 PM

It's the last line of the abstract.

> As a consequence of this succinctness, we show that basic verification problems for transformers, such as emptiness and equivalence, are provably intractable: specifically, EXPSPACE-complete.

show 1 reply