HNHacker News
TopNewBestAskShowJobs

barvinograd

136 karma · joined June 30, 2012

submissionscomments
barvinograd··on Cyclic Tag System: 1 Line of Turing-Complete Code
thanks, I wasn't aware of that. Do you have the reference?
barvinograd··on Cyclic Tag System: 1 Line of Turing-Complete Code
I do have great interest in Wolfram point of view. There is still a lot of research to do in this area. It still feels like the second or third lecture in group theory, before you get to the good parts.
barvinograd··on Memory Efficient String Compression in C#
tkelogg, I am realy happy you found the post interesting and informative. Sometimes one forget to explain things that may seem obvious and one thinks that the code speaks for itself when it doesn't. I'll keep your advice in mind when I'll write my next post. In the mean time I have edited the post and added some additional explanations. Thank You :)
barvinograd··on Memory Efficient String Compression in C#
You are right, it would go into the first generation and will be collected pretty quickly unless it is more than 85KB which many strings that you want to compress are. If you go into that string length you get into the Large Object Heap and that is a disaster. Unsafe work should not be scary. If you check out the code of GetByteCount for UTF8 encoding (as an example) you will see that Microsoft did the same thing.