4 ms·
> An LLM with CoT is Turing-complete. Given arbitrarily large context window.
by emil-lp 2mo ago
> An LLM with CoT is Turing-complete.
Given arbitrarily large context window.
- red75prime 2mo agoSure. As is the case of every physical realization of the abstract Turing machine: there are some limitations.