Let f(x) be x*x for x under a googolplex and the Kolmogorov complexity of x otherwise. f is uncomputable, so we can't know the square of 3.
-
Conditionally computable, where the condition is that the input lies within a specified subset of the domain. Condition is met.
You may be right that we know what the square of 3 is, but I trolled you into teaching me a math concept, so I still won this exchange.
