Cryptids
7 days ago
- #Turing Machines
- #Cryptids
- #Busy Beaver
- Cryptids are Turing Machines with behavior described by simple mathematical rules tied to unsolved problems, often exhibiting Collatz-like behavior.
- The halting problem for Cryptids is mathematically hard, and solving BB(n, m) requires solving these hard problems.
- Notable Minimal Cryptids include Bigfoot (BB(3,3)), Hydra (BB(2,5)), and Antihydra (BB(6)), discovered in the wild.
- Larger Cryptids like ZF (BB(432)), RH (BB(744)), and Goldbach (BB(25)) are constructed and tied to major mathematical conjectures.
- Cryptids were first noticed in the Beeping Busy Beaver problem, with machines requiring Collatz-like problem solutions for proofs.