Comment Comment by red75prime > They’re fundamentally not suited to thinking like we doLLMs with CoT are Turing-complete. So, theoretically, they can implement any kind of finitely describable algorithm (barring super-Turing computations). parent red75prime 1 month ago
LLMs with CoT are Turing-complete. So, theoretically, they can implement any kind of finitely describable algorithm (barring super-Turing computations).