Infinite time busy beavers (Q2011657)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Infinite time busy beavers	scientific article

Statements

scholarly article

0 references

Infinite time busy beavers (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-58741-7_22

0 references

0 references

0 references

Grégory Lafitte

0 references

publication date

4 August 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-58741-7_22

0 references

0 references

0 references

The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4

0 references

The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines

0 references

Infinite time Turing machines

0 references

The Length of Infinite Time Turing Machine Computations

0 references

Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2011657

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2011657&oldid=36337663"