User blog comment:Vel!/Call for math facts/@comment-1605058-20140731155143

I made an errata:


 * I think rope stretching has to be discrete for that to work.


 * Clarification needed to "small" sets: this isn't a definition, just the properties we want it to have.


 * I don't think topology itself allows surface to pass through itself.


 * In rabbit constant, it's worth noting that the string stabilizes.


 * According to Wikipedia, Minkowski's ?(x) derivative vanishes at rational numbers, so it exists and is 0.


 * About normality of pi: it should be noted that we mean _finite_ strings of digits.


 * The first ± in random Fibonacci sequence is unnecessary.


 * These are Ramsey numbers, not Ramsay.


 * About polynomial undecidable problem, it's determining if solution exists, not computing (as we can't compute it).


 * I'd say strengthened Ramsey theorem is first _purely_ arithemtic statement independent of PA. Godel's incompleteness can be coded as arithmetic formula too.