Busy beaver competition and Collatz-like problems

DOI10.1007/BF01409968MaRDI QIDQ688516zbMATH OpenFDO

Authors Pascal Michel

Publication date 9 December 1993

Published in Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

Turing machineshalting problemBusy Beaver Competitionrepeated iteration of Collatz-like functions

Mathematics Subject Classification ID

Sequences and sets (11B99) Turing machines and related notions (03D10)

Recommendations

• Busy beavers and Kolmogorov complexity
• The Collatz problem and analogues
• Small Turing machines and generalized busy beaver competition
• Dynamical systems approach to the busy beaver problem
• The Collatz problem
• Problems in number theory from busy beaver competition
• Some results on the Collatz problem
• Some remarks about the Collatz problem
• Some natural generalizations of the Collatz problem

Cites work

• scientific article; zbMATH DE number 3813599 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 8896 (Why is no real title available?)
• scientific article; zbMATH DE number 3526785 (Why is no real title available?)
• scientific article; zbMATH DE number 4123308 (Why is no real title available?)
• An unsolved problem on the powers of 3/2
• Castor quadruplorum
• Computer Studies of Turing Machine Problems
• MINSKY'S SMALL UNIVERSAL TURING MACHINE
• Solvability of the halting problem for certain classes of Turing machines
• The 3x + 1 Problem and Its Generalizations
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines

Cited in

(15)

• Infinite time busy beavers
• Small Turing machines and generalized busy beaver competition
• The complexity of small universal Turing machines: A survey
• Homology of groups and third busy beaver function
• 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)
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• The Complexity of Small Universal Turing Machines: A Survey
• Frontier between decidability and undecidability: A survey
• Problems in number theory from busy beaver competition
• Small deterministic Turing machines
• Tag systems and Collatz-like functions
• Generating candidate busy beaver machines (or how to build the zany zoo)
• New applications of the polynomial method: the cap set conjecture and beyond

This page was built for publication: Busy beaver competition and Collatz-like problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688516)