Infinite time busy beavers

DOI10.1007/978-3-319-58741-7_22zbMATH Open1489.68093OpenAlexW2612134130MaRDI QIDQ2011657FDOQ2011657

Authors: Oscar Defrain, Bruno Durand, Grégory Lafitte 

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_22

Recommendations

• Busy beaver competition and Collatz-like problems
• A note on busy beavers and other creatures
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 8896
• Improved bounds for functions related to busy beavers

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

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?)
• Infinite time Turing machines
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• The Length of Infinite Time Turing Machine Computations
• The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4

Cited In (8)

• Dynamical systems approach to the busy beaver problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved bounds for functions related to busy beavers
• Busy beaver scores and alphabet size
• The ``paradox of computability and a recursive relative version of the busy beaver function
• Weaker variants of infinite time Turing machines
• Infinite time Turing machines with only one tape

This page was built for publication: Infinite time busy beavers

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