3 ms·

> GPTs inherently can not be Turing complete because they always terminate I'm not sure that was intended entirely seriously. After all, humans always terminat

• bigfishrunning 10mo ago
  To follow on logically, maybe humans aren't Turing complete? we are not equivalent to Turing machines...
  • prolyxis 10mo ago
    Except that as far as I understand, one of the inspirations for the Turing machine is to explain precisely the computations a human computer could perform with (potentially a lot of) pen and paper.
    • stormking 10mo ago
      And an unlimited life span.
    • nkrisc 10mo ago
      Theoretically, not in any sense of reality.
  • wat10000 10mo ago
    We can simulate a Turing machine, given storage. The infinite storage and infinite time is always a sticking point when comparing any real physical system to a theoretical Turing machine, so we tend to ignore those bits.
    • tshaddox 10mo ago
      "Unbounded" is a better term to use than "infinite."
  • FeepingCreature 10mo ago
    No machine instantiated in the physical universe is Turing complete in this sense.
  • thaumasiotes 10mo ago
    You can do everything a Turing machine can do; obviously, you cannot fail to be Turing complete.