MathProgramming
MathProgramming on Hacker News
Re:Online Python Tutor: Learn programming by visualizing code execution
on Tuesday October 02, 2012 @10:13AM (#4602042)
Why would they simulate a linked list using tuples? It seems a bit contrived (or rather, not Pythonic) when lists are a built-in datatype.
Re:Kolmogorov Complexity - A Primer
on Sunday April 22, 2012 @11:48PM (#3877120)
In the context of Turing machines, the output is really a _binary_ string, not a string of arbitrary characters. So in a sense, those two programs are the same thing. But of course, the Kolmogorov complexity of any number n is bounded by log(n) + c.
Re:Kolmogorov Complexity - A Primer
on Sunday April 22, 2012 @11:45PM (#3877116)
I'm not super familiar with the various theories of probability, but if you're interested in thinking of these kinds of things, you might enjoy reading about the Universal Distribution, which is as far as I know defined in terms of Kolmogorov complexity. http://www.scholarpedia.org/article/Algorithmic_probability#...
I know the book Gems of Theoretical Computer Science has a good introduction to this topic as well.
Re:Kolmogorov Complexity - A Primer
on Sunday April 22, 2012 @09:58PM (#3876860)
I think I made the point to say that random only applies to things being drawn from a distribution, but that's really the whole point of the theory: we _want_ to be able to talk about how random a number is! We just call it 'Kolmogorov random' now, and by luck or insight, numbers chosen uniformly at random are almost always Kolmogorov random.