The following pages link to Attacking the busy beaver 5 (Q3971350):
Displaying 13 items.
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- Busy beaver competition and Collatz-like problems (Q688516) (← links)
- Dynamical systems approach to the busy beaver problem (Q696693) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- Improved bounds for functions related to busy beavers (Q1597757) (← links)
- Busy beaver scores and alphabet size (Q1679996) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (Q2249007) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- Generating candidate busy beaver machines (or how to build the zany zoo) (Q2672601) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- A note on busy beavers and other creatures (Q4887488) (← links)
- Naturalness in Mathematics (Q5213636) (← links)