On non-computable functions
From MaRDI portal
Publication:5046182
Recommendations
Cited in
(50)- Some rapidly growing functions
- Several results in program size complexity
- On a problem in the collective behavior of automata
- Expository notes on computability and complexity in (arithmetical) games
- On the rate of decrease in logical depth
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Model discovery and discrete inverse problems with cellular automata and Boolean networks
- Non-malleable functions and their applications
- Autopoietic and \((\boldsymbol{M,R})\) systems
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Finite degree clones are undecidable
- Computational universes
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- The many forms of hypercomputation
- Generating candidate busy beaver machines (or how to build the zany zoo)
- Machines that perform measurements
- Using logical functions for constructing non-linear analytical formulae in combinatorics and number theory
- Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
- A refinement of the Conway algorithm
- scientific article; zbMATH DE number 4043835 (Why is no real title available?)
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Introduction to the \textit{Zambelli Festschrift}
- Observations on computability, uncertainty, and technology
- Fractal dimension versus process complexity
- A study on complexity measure of diamond tile self-assembly system
- Superintelligence cannot be contained: lessons from computability theory
- Finding the hardest formulas for resolution
- Beyond Rogers’ Non-constructively Computable Function
- Weight-reducing Turing machines
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
- Pushdown automata and constant height: decidability and bounds
- scientific article; zbMATH DE number 7770055 (Why is no real title available?)
- An automated approach to the Collatz conjecture
- Combining Finite Combination Properties: Finite Models and Busy Beavers
- Theoretical computer science: computability, decidability and logic
- Number theory combination: natural density and SMT
- Busy agents on a line
- A note on busy beaver bounds
- Constructivity conditions on immune sets
- Dynamical systems approach to the busy beaver problem
- Combining combination properties: minimal models
- Small Turing machines and generalized busy beaver competition
- Rosen's (M,R) system as an X-machine
- Improved bounds on the length of shortest strings accepted by two-way finite automata
- Beavers at the limits of computation
- Non-recursive trade-offs between two-dimensional automata and grammars
This page was built for publication: On non-computable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046182)
