Bigfoot: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
DF376 (talk | contribs)
No edit summary
C7X (talk | contribs)
Add compilation
Line 16: Line 16:


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 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>


[[Category:Stub]]
[[Category:Stub]]
[[Category:Cryptids]]
[[Category:Cryptids]]

Revision as of 08:35, 3 October 2024

Unsolved problem:
Does Bigfoot run forever?

1RB2RA1LC_2LC1RB2RB_---2LA1LA (bbch)

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

A(a,6k,c)A(a,8k+c1,2)if8k+c1A(a,6k+1,c)A(a+1,8k+c1,3)if8k+c1A(a,6k+2,c)A(a1,8k+c+3,2)ifa1A(a,6k+3,c)A(a,8k+c+1,5)A(a,6k+4,c)A(a+1,8k+c+3,2)A(a,6k+5,c)A(a,8k+c+5,3)

A(0,6k+2,c)Halt(16k+2c+7)

starting from A(2,1,2).

It was discovered by Shawn Ligocki 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]

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