Is ChatGPT Turing-complete in the sense that some Transformer network with some possible set of weights and a suitable prompt will reliably-enough simulate an arbitrary Turing machine for an arbitrary number of steps? NO because the network and its input window are both finite.