Dynamical systems approach to the busy beaver problem

DOI10.1016/S0010-4655(02)00356-9zbMath0992.68503MaRDI QIDQ696693

Etsushi Nameda, Toru Ohira, Takashi Ikegami

Publication date: 12 September 2002

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

zbMATH Keywords

dynamical systemspatio-temporal patternbusy beaver problemCollatz 3k+1 mappingTuring machine halting problem

Mathematics Subject Classification ID

Cites Work

• Busy beaver competition and Collatz-like problems
• 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

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