The following pages link to On Non-Computable Functions (Q5046182):
Displaying 34 items.
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- Dynamical systems approach to the busy beaver problem (Q696693) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- Rosen's \((M,R)\) system as an X-machine (Q727124) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Some rapidly growing functions (Q1148900) (← links)
- Several results in program size complexity (Q1152214) (← links)
- On a problem in the collective behavior of automata (Q1223939) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- On the rate of decrease in logical depth (Q1676323) (← links)
- On measuring the complexity of networks: Kolmogorov complexity versus entropy (Q1687410) (← 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)
- Model discovery and discrete inverse problems with cellular automata and Boolean networks (Q2086745) (← links)
- Autopoietic and \((\boldsymbol{M,R})\) systems (Q2177200) (← links)
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (Q2249007) (← links)
- Finite degree clones are undecidable (Q2333801) (← links)
- Computational universes (Q2483574) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Generating candidate busy beaver machines (or how to build the zany zoo) (Q2672601) (← links)
- Machines that perform measurements (Q2672643) (← links)
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach (Q4918008) (← links)
- Introduction to the Zambelli Festschrift (Q5011342) (← links)
- Observations on Computability, Uncertainty, and Technology (Q5011355) (← links)
- A Study on Complexity Measure of Diamond Tile Self-assembly System (Q5114870) (← links)
- Superintelligence Cannot be Contained: Lessons from Computability Theory (Q5145835) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus (Q6040672) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
