acomar

Joined 15 years ago

Karma
770
Submissions
287
Member since
Nov 7
[ my public key: https://keybase.io/arjuncomar; my proof: https://keybase.io/arjuncomar/sigs/-ipz25tgXlJL2aHtiA4_S4MTWL9oc__7Zy_JAGcQk1Y ]
View on Hacker News

Recent submissions

Comment · 24 days ago
Comment · 24 days ago
oh joy, eugenics and miscegenation
Comment · 1 year ago
it's experimenting with a feature that was added to Haskell but just never caught on. it's theoretically very powerful but it's far enough from idiomatic Haskell that it sees basically zero usage in the wild as the cost for using it is that very few people can understand what you've done.
Comment · 2 years ago
there is actually something rather special about the questions mathematicians focus on but the jargon and technical detail get in the way. ultimately, the reason prime numbers are so fascinating is because they turn up in weird places, with strange properties, and connect wildly different branches of mathematics together.

the Riemann Hypothesis is an example of this. it starts from a pair of observations: 1. the sum of the logarithms of the prime numbers less than n approximates the graph of y = x to absurd precision. there's no obvious reason why this should be true but the result just kind of falls out if you attempt to estimate the sum, even in really crude ways. 2. the sum of the reciprocals of the squares was calculated by Euler centuries ago. the way he solved the problem was to connect two different ways of calculating sin(x) -- the Taylor series and a new idea he developed which you may have tried in a calculus class. namely, he wrote down sin(x) as a infinite product of its roots. one result that happens to fall out of this comparison between the infinite sum and the infinite product is that you can factor equations like sum(1/n^2) over all the integers into a product of the reciprocals of the primes.

this second fact leads very directly to a proof of the first through some clever algebra but it's far more general. in fact, we not only get exact values for sum(1/n^2), but exact values for all expressions of the form sum(1/n^s) where s is a positive even integer -- odd powers remain an unsolved problem to this very day. in fact, these sums are hiding in the Taylor expansion of sin(x). so somehow, we've connected a seemingly arbitrary question about how to take a certain kind of sum of the integers, connected it to a product of primes, and tied both to an analytical function -- sin(x). already bizarre.

but it gets even stranger. if you let s vary as a complex number and not just as a positive number > 1, this very same approach lets you calculate the sums for negative even powers as well. remember, we're calculating sum(1/n^s) -- how can we get any result but infinity for sum(1/n^-2) -- i.e. sum(n^2)? more perplexing is that the value you can calculate from algebra and calculus over the complex numbers, following Euler's method, and Riemann's extension of it, is 0 for every negative even power. this is also where the notion that the sum of the integers is -1/12 comes from. this is the Riemann Zeta function.

so now, we've connected a seemingly arbitrary sum of the integers to an analytic function over the complex numbers via prime numbers. and worse still, if we connect this back to the first point, we discover that this Zeta function tells us the order of the error term on the estimate for sum(log p, p < x). remember, this function looks like the graph of y = x. if the Zeta function has a zero at s = 1/2, we have an exact formula for that sum and the error term is precisely O(x^1/2). we can even calculate the constant factors. this fixes all the prime numbers. it in fact gives you an exact formula to calculate them, not as a recursive function, but directly. all because some asshole in the 1700s posed a problem no one could answer until Euler: what's sum(1/n^2)?

so this is why prime numbers fascinate mathematicians. nothing we understand about them is obvious. but being able to answer seemingly arbitrary questions about them unlocks whole fields of mathematics. and new techniques in completely unrelated fields of mathematics suddenly answer deep questions about the structure of the natural numbers.

if this topic interests you, I highly recommend this series of videos from zetamath: https://www.youtube.com/watch?v=oVaSA_b938U&list=PLbaA3qJlbE... -- he walks you through the basic algebra and calculus that lead to all of these conclusions. I can't recommend this channel enough.

Comment · 2 years ago
I've found the opposite. every time I attempt to subvert the borrow checker, I eventually discover that I'm attempting to write a bug.
Comment · 2 years ago
Comment · 2 years ago
you've misunderstood my point -- I'm saying manufacturer claims need to be verified. 10x doesn't mean all that much to begin with and, moreover, fan static pressure claims from manufacturers get verified by virtually no one. a shady manufacturer could straight up make up these numbers and no one would be the wiser because of that lack of independent verification. it's like if a CPU GHz figure was taken at face value, without testing.
Comment · 2 years ago
he was extremely insightful and developed new math so effortlessly. if he'd survived, a lot of math would have advanced more quickly than it did.
Comment · 2 years ago
it also doesn't help that the fix for the increased difficulty in implementing AsyncIterator for devs (assuming the approach advocated for in the OP winds up being the one selected by the language team) relies on the as yet (?) unstabilized generators/async generators feature. I'm not really why it's not available yet as the necessary compiler features are already in place and have been for years but because it's not, this is kind of a hard pill to swallow.
Comment · 2 years ago
such claims without tests to validate are kind of useless. they're just taking the company at their word.
Comment · 3 years ago
Comment · 3 years ago
I mean, lots of animals use tools, including chimps. those tools aren't nearly as sophisticated, so it depends on how you define tool use, but the point still stands. this is all besides the point.
Comment · 3 years ago
thanks, I appreciate this
Comment · 3 years ago
> "We haven't yet found a specific neural structure for recognizing faces" is far from evidence that no such structure exists.

proving a negative is, famously, quite hard. an unsolved problem, even. facial recognition has a plethora of evidence beyond an argument from evolution. the notion that we humanize tools is one that, as yet, lacks that evidence. I urge people to be more skeptical of arguments from evolution. we understand very little about our evolution and it's easy to insert our own worldviews and beliefs into such arguments, allowing them to state virtually anything we like in a plausible envelope with the shape of a scientific argument. I'm not just calling the argument about humanizing tools pseudoscience -- I'm applying it equally to every other argument from evolution that lacks other motivating evidence.

Comment · 3 years ago
except no such neural structure has ever been found. humans have been using tools for longer than we've been human -- without solid evidence that this tool is interpreted as a social actor, based on real neuroscience, this kind of claim rooted in an evolutionary argument is psuedoscience. people have been making arguments from evolution to say all kinds of nonsense things since Darwin (like justifying racial hierachies). which neural structure is posited to cause us to humanize our tools?

if anything, the historical evidence points in the opposite direction -- that people objectify far more than they humanize, even when the cost is measured in hundreds, thousands, or millions of lives. that's merely an observation, not a hypothesis or a claim about what people will do or about what they are capable of doing. we ought to humanize more often.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton