Pages that link to "Item:Q3666832"
From MaRDI portal
The following pages link to The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines (Q3666832):
Displaying 14 items.
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Busy beaver competition and Collatz-like problems (Q688516) (← links)
- Dynamical systems approach to the busy beaver problem (Q696693) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences (Q1693803) (← links)
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks (Q1782785) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (Q2249007) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- Generating candidate busy beaver machines (or how to build the zany zoo) (Q2672601) (← links)
- Computer Runtimes and the Length of Proofs (Q2891314) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- A note on busy beavers and other creatures (Q4887488) (← links)
