abhi9u

8 ms·

61.
Intuitive guide to convolution(betterexplained.com)
63 points by abhi9u 3y ago|24 comments
62.
An introduction to functional programming through lambda calculus (1988) [pdf](macs.hw.ac.uk)
1 points by abhi9u 3y ago|0 comments
63.
A History of Subtyping [video](youtube.com)
1 points by abhi9u 3y ago|0 comments
64.
Trojan Room Coffee Pot(en.wikipedia.org)
107 points by abhi9u 3y ago|31 comments
65.
A Path Towards Autonomous Machine Intelligence (2022)(openreview.net)
1 points by abhi9u 3y ago|0 comments
66.
CPython Object System Internals: Understanding the Role of PyObject(codeconfessions.substack.com)
4 points by abhi9u 3y ago|0 comments
67.
by abhi9u 3y ago
Not really, you have an option to exclude your content from being indexed by Google (robots.txt). I don't care as much about Google losing money because of ad-blockers, they have plenty of money going around. The real people losing her
68.
Programming on Parallel Machines; GPU, Multicore, Clusters and More(heather.cs.ucdavis.edu)
122 points by abhi9u 3y ago|30 comments
69.
The Changing "Guarantees" Given by Python's Global Interpreter Lock(stefan-marr.de)
103 points by abhi9u 3y ago|134 comments
70.
by abhi9u 3y ago
It is supposedly an inside joke and not an actual test. Source: https://twitter.com/michael_nielsen/status/17249896200296205...
71.
Generating Random Factored Numbers, Easily (2002) [pdf](inst.eecs.berkeley.edu)
3 points by abhi9u 3y ago|3 comments
72.
Reptar(lock.cmpxchg8b.com)
601 points by abhi9u 3y ago|176 comments
73.
Use of HTTPS Resource Records(netmeister.org)
3 points by abhi9u 3y ago|0 comments
74.
by abhi9u 3y ago
Thank you (author here). I don't read TAOCP. I have read first few chapters of volume-1 so I am familiar with the notation and some MIX syntax. But while writing this article, I just opened up specific topics, such as computing Fibonac
75.
by abhi9u 3y ago
My bad. I should have looked into the docs. Thanks for pointing out!
76.
It's Time to Kill Moore's Law(notes.arkinfo.xyz)
1 points by abhi9u 3y ago|0 comments
77.
by abhi9u 3y ago
Thank you. I will do it.
78.
by abhi9u 3y ago
Nice! Thank you for sharing.
79.
by abhi9u 3y ago
Yes, that book (thirty three miniatures) has great content, but a hard read. Basically someone like me needs to go back, read other sources, and spend time on paper to get it.
80.
by abhi9u 3y ago
Very cool. Thanks for sharing.
81.
by abhi9u 3y ago
Knuth shows that technique in TAOCP, vol-1. It was on the longer side and I didn't want to reproduce it in the interest of space and time. I was more focused on the matrix form.
82.
by abhi9u 3y ago
That's a work of art. Amazing
83.
by abhi9u 3y ago
Python has arbitrary precision integers, so you could do it without running into overflows. Although if implementing floating point based technique, you may want to use np.float128 to handle values upto 10^4932.
84.
by abhi9u 3y ago
Thank you so much, both for providing more background on exponentiation, and for the reference. :-)
85.
by abhi9u 3y ago
Yes, indeed. If you see the thirty three miniatures book, it gives the matrix exponentiation formula for computing Fibonacci numbers, without any explanation behind it. To write the article, I tried to figure out ways it can be explained. A
86.
by abhi9u 3y ago
Author here: At the time of writing, I was not aware that the matrix form and the closed form are same, because you can derive the golden ratio based formula from the matrix formula. Full disclaimer: I am not a math major, and I can make su
87.
by abhi9u 3y ago
I just read the exercise. That's very clever. Makes me want to sit and go through the book.
88.
by abhi9u 3y ago
But that seems to be computationally same amount of work as the matrix form, so we get similar performance?
89.
by abhi9u 3y ago
Interesting, TIL. Thanks for sharing. :)
90.
by abhi9u 3y ago
That's quite true. And so many books to teach it. I am a software engineer and don't have a major in math beyond studying discrete math in college. So I really have to work hard to understand these proofs. And I certainly value pr

More ›