ConceptComputable Function
Computable Function
A function for which there exists a Turing machine that, for any input, produces an output and halts within a finite number of steps. Computable functions stand in contrast to uncomputable functions, which cannot be evaluated by any such machine. The concept forms the foundation of computability theory and defines the class of problems that are solvable by algorithmic means.
Timeline (last 90 days)
Oct 13
For any computable function f, there exists some n such that BB(n) > f(n).
Unverified50%
Oct 13
Graham's number is computable; there exists a finite algorithm that can write it out.
Unverified50%