bio | website | |
---|---|---|
location | San Francisco | |
age | ||
visits | member for | 3 years, 9 months |
seen | Apr 6 at 19:02 | |
stats | profile views | 341 |
Computer graphics professional with mathematics as a hobby.
Apr 8 |
awarded | Popular Question |
Aug 2 |
accepted | Do all uncountable sets contain elements with infinite Kolmogorov complexity? |
Feb 25 |
accepted | Inequality constraints, probability distributions, and integer partitions |
Jul 15 |
comment |
Inequality constraints, probability distributions, and integer partitions
I plan on accepting your answer as soon as I take the time to double check the work. Thanks! |
Jul 14 |
comment |
A probability question related to extremal combinatorics
What I mean, is if one person picks (2,3,4) can another person pick (2,3,4) |
Jul 14 |
comment |
A probability question related to extremal combinatorics
I'm still trying to grasp the problem. When a combination is selected is it replaced |
Jul 14 |
comment |
Volumes of Sets of Constant Width in High Dimensions
@Theo If you made a hole, you could jam two parallel tangent planes in it that would of smaller width than the convex hull, so that wouldn't work. |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
I think the issue is, determining what the finite representation of a infinite sequence is, is part of the the bijection I need to go to the $\mathbb{Z}$ (the pairing function being the other part), and maybe there is no way to make the whole function a bijection to $\mathbb{Z}$. |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
If we look at every element in the set you describe you can split the elements into two sequences, one with all zero's (a) and one with numbers that are unconstrained (b). According to the definition of the set, it is my understanding that both a and b could must a finite representation (relative to a UPM). I would use the finite representation in my pairing function. Maybe I am missing using the terminology of a pairing function. My understanding is that a 2d pairing function would be used to show the rationals are in 1-to-1 with $\mathbb{Z}$ and 4d one for complex rationals, etc. |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
@Carl If one is to change the terminology as you have prescribed, can the question be made well posed? – Jonathan Fischoff 0 secs ago |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
Yes, I did not realize that there was a distinction. Thanks for the clarification :) |
Jul 12 |
revised |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
updated to change infinite -> random |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
@Carl, what is the correct term for strings that cannot be compressed? |
Jul 12 |
comment |
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
@Andres could you elaborate on your comment for my own edification? |
Jul 12 |
asked | Do all uncountable sets contain elements with infinite Kolmogorov complexity? |
Jul 12 |
awarded | Teacher |
Jul 12 |
answered | How do I make the conceptual transition from multivariable calculus to differential forms? |
Jul 7 |
comment |
What are you using for symbolic computation?
another list mathoverflow.net/questions/19046/… |
Jul 7 |
comment |
What are you using for symbolic computation?
A list for reference en.wikipedia.org/wiki/Comparison_of_computer_algebra_systems |
Jul 7 |
comment |
Inequality constraints, probability distributions, and integer partitions
Woah. Just saw your edit. I did not expect that. |