kurlberg

5 ms·

1.
by kurlberg 2mo ago
It's complicated. :-) There is a nice picture of the "best" choice for different ranges of sizes of numbers to be multiplied at http://gmplib.org/devel/log.i7.1024.png More context and explanation can be
2.
by kurlberg 3mo ago
"Learning styles" might be a myth. Eg, see Learning Styles: VAK Doesn't Exist (Here's What Research Actually Shows) https://www.structural-learning.com/post/learning-styles-myt... Belief in Learning
3.
by kurlberg 3mo ago
Even Terry Tao struggled at times: "When I was a graduate student in Princeton, Tom Wolff came and gave a course on recent progress on the restriction and Kakeya conjectures, starting from the breakthrough work of Jean Bourgain in a no
4.
by kurlberg 3mo ago
There is a joke saying "a mathematician says X, writes Y on the board and means Z". The really amusing(?) thing is that other mathematicians still (sort of) perfectly understands Z. Once you have enough experience you fill in the
5.
by kurlberg 4mo ago
Where?
6.
by kurlberg 4mo ago
There is a cute argument (I think it is due to Erdos) that, asymptotically, 0% of the integers in [0,n^2] appears in the "n by n multiplication table": By Erdos-Kac, almost all integers of size about n^2 have about log(log(n^2)) ~
7.
by kurlberg 5mo ago
I had the same impulse (or at least copy.fail inducing many to upgrade at the same time.) However, it might be a "pro-Iran hacktivist group" according to https://www.theregister.com/2026/05/01/canoni
8.
by kurlberg 6mo ago
Convolution alone does not smooth. Eg consider a random variable supported on the pts 0 and 1 (delta masses at 2 pts.) No matter how many convolutions you do, you still have support on integers - not smooth at all. You need appropriate resc
9.
by kurlberg 8mo ago
Read it as a young teenager, can recommend.
10.
by kurlberg 10mo ago
This has been discussed on HN some times before. User xornot looked at the zfs source code and debunked "faulty ram corrupts more and more on scrub", for more details see https://news.ycombinator.com/item?id=142075
11.
by kurlberg 11mo ago
I don't think this is entirely due to Wozniak. Early "home" computer systems were based on connecting cards to a bus (eg the S-100 bus), eg. with one card supporting the CPU, another RAM, a third for disk drive, video card et
12.
by kurlberg 11mo ago
Fun historical fact: knot theory got a big boost when lord Kelvin (yeah, that one) proposed understanding atoms by thinking of them as "knotted vortices in the ether".
13.
by kurlberg 1y ago
If you have a child who likes math I highly recommend "Really Big Numbers" by Richard Schwarz. Tons of nice illustrations on how to "take bigger and bigger steps". "Infinity is farther away than you thought."
14.
by kurlberg 2y ago
I recently got into making some sort of budget hifi setup, and found audiosciencereview.com quite helpful - a good amount of reviewed gadgets with focus on measurements. Ended up with kali lp-6v2 speakers and a SMSL SU-1 dac. Please don&#x2
15.
by kurlberg 2y ago
I have used merlin for quite a while, mostly happy (except for some security holes...) However, once asus drops support for older devices (e.g. rt-ac68u and rt-ac86u), merlin might also drop it. For now rt-ac68u is dropped by merlin, but ac
16.
by kurlberg 2y ago
Based on reddit [1] and other some other recommendations I got an asus ax4200 and put openwrt on it. I'm fairly happy, but some people have run into connection dropping (possibly due to ISP power saving resulting in link dropping down
17.
by kurlberg 2y ago
PS: if you're interested in multiplying "ludicrously large numbers", Harvey and van der Hoeven had a nice breakthrough and got multiplication down to "FFT speed" (n*log(n)), see https://hal.science/h
18.
by kurlberg 2y ago
There is a nice picture of the "best" for different ranges of sizes of numbers to be multiplied at http://gmplib.org/devel/log.i7.1024.png More context and explanation can be found at: http://gmpli
19.
by kurlberg 2y ago
Check out "Diamond Age" by Neal Stephenson.
20.
by kurlberg 3y ago
It's very inefficient, both on terms of runtime and in terms wasted entropy.
21.
by kurlberg 4y ago
This has been discussed on HN some times before. User xornot looked at the zfs source code and debunked it, for more details see https://news.ycombinator.com/item?id=14207520
22.
by kurlberg 5y ago
Yes, it has uses. E.g., see Kahan's "Branch Cuts for Complex Elementary Functions, or Much Ado About Nothing's Sign Bit", copy available at https://people.freebsd.org/~das/kahan86branch.pdf (he give
23.
by kurlberg 5y ago
Years ago I saw it at: https://www.truenas.com/community/threads/ecc-vs-non-ecc-ram... (the gist of the scary story is that faulty ram while scrubbing might kill "everything".) However, in the end ECC ap
24.
by kurlberg 5y ago
There is an extremely nice "Digital show and tell" video by Monty at https://xiph.org/video/vid2.shtml (part 1 at https://xiph.org/video/vid1.shtml is also very well worth watching.)
25.
by kurlberg 6y ago
I lived in the states for a while and missed Bregott. "Land o Lakes butter with canola oil" is a pretty good substitute.
26.
by kurlberg 6y ago
According to https://www.servethehome.com/hpe-proliant-microserver-gen10-... the 10+ seems to run freenas fine.
27.
by kurlberg 6y ago
Thanks! I've got a new alias cut out for me: duh! :-)
28.
by kurlberg 6y ago
I'm overall very happy with my kinesis advantage, but there is something (subtle?) to be aware of: you tend to use your thumbs quite a bit to hit control/alt/return/space (especially with emacs), and after some time my t
29.
by kurlberg 6y ago
Another option is du | sort -n (I've got it aliased to "dun".)
30.
by kurlberg 6y ago
It's not only in the abstract - "category" occurs all over the document. Possibly he's poking fun at category theory/theorists.

More ›