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

DOI10.2307/2007539zbMath0518.03013OpenAlexW4230077439MaRDI QIDQ3666832

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)

Related Items (14)

Computer Runtimes and the Length of Proofs ⋮ The Complexity of Small Universal Turing Machines: A Survey ⋮ Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ A computable measure of algorithmic probability by finite approximations with an application to integer sequences ⋮ A note on busy beavers and other creatures ⋮ Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness ⋮ Busy beaver competition and Collatz-like problems ⋮ Dynamical systems approach to the busy beaver problem ⋮ Small Turing machines and generalized busy beaver competition ⋮ Infinite time busy beavers ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ 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