Bigfoot: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
No edit summary
(Add savask as co-discoverer)
Line 15: Line 15:
starting from <math>A(2, 1, 2)</math>.
starting from <math>A(2, 1, 2)</math>.


It was discovered by Shawn Ligocki on 14 Oct 2023 and shared in the blog post [https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html BB(3, 3) is Hard].
It was discovered by Shawn Ligocki and savask on 14 Oct 2023 and shared in the blog post [https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html BB(3, 3) is Hard].


In May 2024, Iijil shared a 7-state, 2-symbol machine with the same behavior as Bigfoot.<ref>P. Michel, "[https://bbchallenge.org/~pascal.michel/ha.html Historical survey of Busy Beavers]". Accessed 3 October 2024.</ref>
In May 2024, Iijil shared a 7-state, 2-symbol machine with the same behavior as Bigfoot.<ref>P. Michel, "[https://bbchallenge.org/~pascal.michel/ha.html Historical survey of Busy Beavers]". Accessed 3 October 2024.</ref>

Revision as of 16:27, 13 March 2025

Unsolved problem:
Does Bigfoot run forever?

1RB2RA1LC_2LC1RB2RB_---2LA1LA (bbch)

Bigfoot is a BB(3,3) Cryptid. It simulates the Collatz-like function

starting from .

It was discovered by Shawn Ligocki and savask on 14 Oct 2023 and shared in the blog post BB(3, 3) is Hard.

In May 2024, Iijil shared a 7-state, 2-symbol machine with the same behavior as Bigfoot.[1]

References

  1. P. Michel, "Historical survey of Busy Beavers". Accessed 3 October 2024.