scientific article; zbMATH DE number 8896
From MaRDI portal
Publication:3971350
Recommendations
Cited in
(17)- Infinite time busy beavers
- Small Turing machines and generalized busy beaver competition
- A note on busy beavers and other creatures
- Busy beavers and Kolmogorov complexity
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- Combining Finite Combination Properties: Finite Models and Busy Beavers
- Busy beaver competition and Collatz-like problems
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Busy beaver scores and alphabet size
- Dynamical systems approach to the busy beaver problem
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
- The Complexity of Small Universal Turing Machines: A Survey
- Naturalness in mathematics
- scientific article; zbMATH DE number 1927169 (Why is no real title available?)
- scientific article; zbMATH DE number 3902041 (Why is no real title available?)
- Generating candidate busy beaver machines (or how to build the zany zoo)
- Improved bounds for functions related to busy beavers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971350)
