Small Turing machines and generalized busy beaver competition
type: Item
instance of: scholarly article
title: Small Turing machines and generalized busy beaver competition
zbMATH Open document ID: 1071.68025
author: Pascal Michel
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 11B85
zbMATH DE Number: 2126105
zbMATH Keywords: Turing machines
zbMATH Keywords: Decidability
zbMATH Keywords: Busy beaver competition
zbMATH Keywords: \(3x+1\) problem
zbMATH Keywords: Collatz problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.05.008
OpenAlex ID: W2006301099
cites work: Q4530860
cites work: The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
cites work: Q4103618
cites work: Small universal one-state linear operator algorithm
cites work: Small deterministic Turing machines
cites work: Q4737918
cites work: The 3x + 1 Problem and Its Generalizations
cites work: Computer Studies of Turing Machine Problems
cites work: Frontier between decidability and undecidability: A survey
cites work: Q3971350
cites work: Busy beaver competition and Collatz-like problems
cites work: Q5586325
cites work: Q5590814
cites work: Castor quadruplorum
cites work: Solvability of the halting problem for certain classes of Turing machines
cites work: Q3862404
cites work: On Non-Computable Functions
cites work: MINSKY'S SMALL UNIVERSAL TURING MACHINE
cites work: Q3661558
cites work: Q4383577
cites work: Small universal Turing machines
cites work: The dynamical system generated by the \(3n+1\) function
DOI: 10.1016/J.TCS.2004.05.008
description: scientific article; zbMATH DE number 2126105