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