A note on busy beavers and other creatures

DOI10.1007/BF01192693zbMATH Open0848.68036OpenAlexW2010433167WikidataQ55922886 ScholiaQ55922886MaRDI QIDQ4887488FDOQ4887488

Authors: Bryant A. Julstrom, Uri Zwick, Amir M. Ben-Amram 

Publication date: 5 August 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192693

Recommendations

• Improved bounds for functions related to busy beavers
• Infinite time busy beavers
• Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
• scientific article; zbMATH DE number 8896

zbMATH Keywords

busy beaver function

Mathematics Subject Classification ID

Cites Work

• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• Title not available (Why is that?)
• Computer Studies of Turing Machine Problems

Cited In (14)

• Dynamical systems approach to the busy beaver problem
• Castor quadruplorum
• Busy beavers and Kolmogorov complexity
• Homology of groups and third busy beaver function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
• Atto-foxes and other minutiae
• Improved bounds for functions related to busy beavers
• Busy beaver scores and alphabet size
• Busy beavers gone wild
• Infinite time busy beavers
• Title not available (Why is that?)
• The ``paradox of computability and a recursive relative version of the busy beaver function

This page was built for publication: A note on busy beavers and other creatures

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