Infinite time busy beavers

DOI10.1007/978-3-319-58741-7_22zbMath1489.68093OpenAlexW2612134130MaRDI QIDQ2011657

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4

This page was built for publication: Infinite time busy beavers