A note on busy beavers and other creatures

DOI10.1007/BF01192693zbMath0848.68036OpenAlexW2010433167WikidataQ55922886 ScholiaQ55922886MaRDI QIDQ4887488

Uri Zwick, Bryant A. Julstrom, 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

zbMATH Keywords

busy beaver function

Mathematics Subject Classification ID

Related Items (2)

Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ Dynamical systems approach to the busy beaver problem

Cites Work

• Unnamed Item
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• Computer Studies of Turing Machine Problems

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