> For any undecidable proposition ,P, the number defined by "if P then x > else y", where x and y are computable numbers and not equal, defines > an uncomputable number.
No it doesn't. Computability is a purely extensional notion. In addition, there is no mathematical definition of undecidability (of propositions) in any absolute sense.
-- Aatu Koskensilta (aatu.koskensilta@uta.fi)
"Wovon man nicht sprechan kann, darüber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus
