Saturday, May 27, 2006

ideas from the presentation

what if W(C) is irrational.

Talk about the if part first, so that the intuition is conveyed. Otherwise, it may give an idea of where the theorem is going. This is partly true because, we begin with the conditions for computability of S and give a condition of computability of S'

recession cone: give Ax<=b and Ax<=0 in the pictures, by moving the constraints through the origin. construct the recession cone from the generators also????

blackbox on the final slide should say:

yes if S is computable.
maybe otherwise.

suppose we give a definition of FATNESS. does that mean that the blackbox can give NO answer?

Make it clear if the statements are for computability or incomputability.
Are there better terms than if and only-if conditions? How about necessary and sufficient conditions? Is the following idea true: "The if part is weaker than necessary condition." If the if-part is added to FAT SURE's, then do we have a necessary condition?

Define a URE after the definining SURE.

No comments: