In that case, either of "return false" or "return true" are valid computable functions depending on the domain you're operating in (with CH or without it). It'

In that case, either of "return false" or "return true" are valid computable functions depending on the domain you're operating in (with CH or without it). It's the same essentially as a function that returns true if any two lines will eventually intersect. The correct answer depends on whether you're in curved space or not. That the correct answer depends on the domain or axioms doesn't make it non computable. There's just no case where a constant function isn't computable in the technical sense.