Busy beaver competition and Collatz-like problems
From MaRDI portal
Publication:688516
DOI10.1007/BF01409968zbMath0779.03009MaRDI QIDQ688516
Publication date: 9 December 1993
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Related Items
HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION ⋮ The Complexity of Small Universal Turing Machines: A Survey ⋮ Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ Small deterministic Turing machines ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ Tag systems and Collatz-like functions ⋮ Dynamical systems approach to the busy beaver problem ⋮ Small Turing machines and generalized busy beaver competition ⋮ The complexity of small universal Turing machines: A survey ⋮ Closed-form analytic maps in one and two dimensions can simulate universal Turing machines ⋮ Frontier between decidability and undecidability: A survey
Cites Work
- Castor quadruplorum
- Solvability of the halting problem for certain classes of Turing machines
- The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
- The 3x + 1 Problem and Its Generalizations
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- Computer Studies of Turing Machine Problems
- An unsolved problem on the powers of 3/2
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item