Originally from April 2024, forgot to post here apparently - but seems relevant as we head closer to the eschaton.
These models can operate as computers, and given enough memory, they can compute any computable program. The model is shown tapes for a few rules, and generalizes the process of running all remaining rules on random inputs without error, over thousands of attempts.
Stephen Wolfram said via email: “I assume ‘unbounded computation’ is happening through the next token iteration process.”
1 comment
[ 3.1 ms ] story [ 11.1 ms ] threadThese models can operate as computers, and given enough memory, they can compute any computable program. The model is shown tapes for a few rules, and generalizes the process of running all remaining rules on random inputs without error, over thousands of attempts.
Stephen Wolfram said via email: “I assume ‘unbounded computation’ is happening through the next token iteration process.”
Logs (deleted due to GitHub retention policy):
https://drive.google.com/file/d/12ZM2DYUysIvcpyJG5ufBWYT77tb...
It was also, in a separate experiment, able to do multiplication for up to 16-digit products using binary.
Repo: https://github.com/SpellcraftAI/turing