Is GPT computationally equivalent to a finite automaton?

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• GPT's ability to simulate text automata is the source of its most surprising and pivotal implications for paths to superintelligence.claim0.801
  Importance of recursive generation.
• Is GPT corrigible?question0.755
  Disambiguation exercise.
• GPT, insofar as it is inner-aligned, is a simulator which can simulate agentic and non-agentic simulacra.claim0.754
  Central thesis of the post.
• Can GPT write its successor?question0.748
  Disambiguation exercise.
• GPT is behavior cloning, but it is the behavior of a universe that is cloned, not of a single demonstrator.claim0.731
  Broadening behavior cloning to universal simulation.
• GPT doesn't seem to care which agent it simulates, nor if the scene ends and the agent is effectively destroyed.claim0.729
  Illustrates the simulator-simulacra distinction.
• GPT is corrigible in a negative sense because the agent specification (prompt) is not fixed by the policy and the policy lacks direct training incentives to control its prompt.claim0.725
  GPT's corrigibility explained.
• GPT does not generate rollouts during training, so there is no reason to expect that GPT will form preferences over the consequences of its output related to the text prediction objective.claim0.725
  Argues against instrumental convergence in GPT.