chatGPT is Turing complete.

why? because it can run BASIC, and BASIC is Turing complete. for example, this slightly skewed Fibonacci sequence:

10 LET X = 0 
20 LET Y = 1 
30 FOR N = 1 TO 15 
40 LET Z = X + Y + 1
50 LET X = Y 
60 LET Y = Z 
70 PRINT Z
80 NEXT N

and it works.

---

Filed under: AI - @ 1 November 2024 12:47 pm