Dynamical systems approach to the busy beaver problem

DOI10.1016/S0010-4655(02)00356-9zbMATH Open0992.68503MaRDI QIDQ696693FDOQ696693

Authors: Etsushi Nameda, T. Ohira, Takashi Ikegami 

Publication date: 12 September 2002

Published in: Computer Physics Communications (Search for Journal in Brave)

Recommendations

• Busy beaver competition and Collatz-like problems
• scientific article; zbMATH DE number 1927169
• A note on busy beavers and other creatures
• scientific article; zbMATH DE number 8896
• Infinite time busy beavers

zbMATH Keywords

dynamical systembusy beaver problemCollatz 3k+1 mappingspatio-temporal patternTuring machine halting problem

Mathematics Subject Classification ID

Cites Work

• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• A note on busy beavers and other creatures
• On non-computable functions
• Busy beaver competition and Collatz-like problems

Cited In (3)

• Intelligent Versus Random Beavers—an Agent‐Based Approach in Facing the Busy Beaver Problem
• Busy beaver competition and Collatz-like problems
• Title not available (Why is that?)

This page was built for publication: Dynamical systems approach to the busy beaver problem

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