Given only a series of input tapes, Opus learns to compute solutions for the A::B problem with 100% accuracy at 24 steps, and Rule 110 for a 12-token tape over 12 steps (accuracy over large runs not yet measured).
See:
-
Notifications
You must be signed in to change notification settings - Fork 5
Turing machines, Rule 110, and A::B reversal using Claude 3 Opus.
License
SpellcraftAI/turing
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Turing machines, Rule 110, and A::B reversal using Claude 3 Opus.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published