I am not sure if this type of question is appropriate for "mathoverflow.net", but I will take the chance. Are there any examples of (well-known or interesting) problems in geometry which ask for the minimum (or greatest lower bound) or else ask for the maximum (or least upper bound) of a set of real numbers such that the answer is known to be non-computable or (at least) has not been proved to be computable? I am thinking, for instance, of the following modified version of Lebesgue's Universal Covering problem. "What is the minimum (or greatest lower bound) of plane convex sets that cover every plane set having diameter 1" I want to know about definitions of specific non-computable real numbers which do not make use of any concepts from computability-theory, such as Turing machines or Recursive Functions. Of course, once you have the definition, you may use these concepts to prove that the number you have defined is non-computable. I feel that geometry is one branch of mathematics in which there might be a good chance of encountering such definitions.