Main public logs

Jump to navigation Jump to search

Combined display of all available logs of BusyBeaverWiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

Logs
  • 06:23, 14 June 2026 Sligocki talk contribs created page Branching Beaver (Created page with "The '''Branching Beaver''' ('''BrB'''(n,m)) is a Busy Beaver Function for '''Trivalent Turing Machines''' ('''TTM'''). A Trivalent Turing Machine is a Turing machine with the tape replaced by a 3-regular wikipedia:Bethe lattice. This is a graph where every node has exactly 3 neighbors. Like with traditional TM tapes, this branching tape is infinite and has no cycles. It can be thought of as an infinite binary tree with no root node (every node has 2 childre...")