The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines

DOI10.2307/2007539MaRDI QIDQ3666832zbMATH OpenOpenAlexFDO

Authors Allen H. Brady

Publication date 1983

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2007539

zbMATH Keywords

Turing machinesbusy beaver competition

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cited in

(14)

• Infinite time busy beavers
• Small Turing machines and generalized busy beaver competition
• A note on busy beavers and other creatures
• A computable measure of algorithmic probability by finite approximations with an application to integer sequences
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Busy beaver competition and Collatz-like problems
• On the complex behavior of simple tag systems -- an experimental approach
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• Computer runtimes and the length of proofs. With an algorithmic probabilistic application to waiting times in automatic theorem proving
• 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
• Generating candidate busy beaver machines (or how to build the zany zoo)
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks

This page was built for publication: The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines

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