Conditionally computable, where the condition is that the input lies within a specified subset of the domain. Condition is met.
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.
-
-
-
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.
End of conversation
New conversation -
-
-
Uncomputable means that we can't have a general way of computing all values. But particular values might have ways of being computed. In this case, by the way, the answer is 9.
-
Or perhaps 7. There's a lot that we don't know about infinity.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.