HNHacker News
TopNewBestAskShowJobs

Chinjut

3,384 karma · joined June 23, 2014

submissionscomments
Chinjut··on Doge 'didn't test' Social Security fraud detection tool at appropriate scale
The only thing that matters is money. No one should talk about or do anything, or have any opinion, except insofar as they are paid to or pay.
Chinjut··on Thank HN: The puzzle game I posted here 6 weeks ago got licensed by The Atlantic
Re: many comments: The puzzle (as I think of it) is NOT to get the top-level answer. The puzzle is to get all the answers. If you figure out an outer answer earlier, that acts as a clue for an inner answer, just as inner answers act as clues for outer answers. A crossword isn't speedrun by just filling in the bottom-rightmost word.
Chinjut··on What if we made advertising illegal?
The argument you seem to be proposing applies to any policy whatsoever. "Well, you have to convince people to vote for you and your policies". Ok, sure, that's what's being done.
Chinjut··on I Hired 5 People to Sit Behind Me and Make Me Productive for a Month
Productivity = Blog posts
Chinjut··on Tesla deliveries down 43% in Europe while EVs are up 31%
But (I'm told) no one will be incentivized to innovate and do good for the world if they cannot have over $100M.
Chinjut··on "Data" Sucks
Reading the post, it seems like what sucks is variables without readily accessible types.
Chinjut··on Brown Medicine professor and doctor deported to Lebanon despite valid visa
It implicitly paints the administration, and thus Elon Musk, and thus Silicon Valley bigwigs, in a bad light. Very many of the users of this site will flag anything which does so, under the guise of politics being not of interest to hackers, even as many other users of this site express interest in such conversations. (Even for me to honestly mention this phenomenon is technically against the rules, though.)
Chinjut··on Brown University Professor Is Deported Despite a Judge's Order
Too late. It's been flagged.
Chinjut··on Ask HN: How much do salaried full-time devs *actually* work?
You should be working 4 hours a day. It's 2025.
Chinjut··on State Department Will Use AI to Search for 'Pro-Hamas' Students to Deport
It implicitly paints the administration, and thus Elon Musk, and thus Silicon Valley bigwigs, in a bad light. Very many of the users of this site will flag anything which does so, under the guise of politics being not of interest to hackers, even as many other users of this site express interest in such conversations. (Even for me to honestly mention this phenomenon is technically against the rules, though.)
Chinjut··on How the U.K. broke its own economy
Is there something intrinsic to the general setup of government spending in the 1950s that makes it incompatible with equal rights for minorities and women? These would seem to be orthogonal issues.
Chinjut··on Math That Matters: The Case for Probability over Polynomials
Are polynomials not used in probability?
Chinjut··on Two senators question Air Force nominee's SpaceX connections
Oh, the American Enterprise Institute agrees with the Republicans, does it?
Chinjut··on Show HN: Bracket City – A daily, exploded (?) crossword puzzle
I'm enjoying this a lot! Thanks for making it!
Chinjut··on After 20 years, math couple solves major group theory problem
Don't listen to ChatGPT. There are 44 non-abelian and 6 abelian groups of order 72. I wouldn't say these particular numbers are terribly important, but they are correct.
Chinjut··on ArXiv LaTeX Cleaner: Clean the LaTeX code of your paper to submit to ArXiv
What question?
Chinjut··on 30% drop in O1-preview accuracy when Putnam problems are slightly variated
You are correct. Their answer is instead the sum of the first k terms of 1, 2, 6, 10, 14, 18, ..., for positive k.
Chinjut··on Numbers Are Leaves
Encoding n as the set of all m < n is called "von Neumann ordinals". Encoding (positive) n as just the singleton set containing n's immediate predecessor is called "Zermelo ordinals". The main advantage of using the former representation rather than the latter is that it allows uniformly encoding not just finite ordinals, but also transfinite ordinals, many of which do not have an immediate predecessor. E.g., in the von Neumann ordinal system, the infinite set of all finite ordinals may itself be interpreted as an ordinal value larger than every finite one. (And then the set of finite ordinals ∪ {the set of finite ordinals} becomes yet a larger transfinite ordinal still, and so on...)
Chinjut··on Quiver: A Modern Commutative Diagram Editor
Note that Quiver isn't really a tool just for drawing "commutative diagrams". It's a tool for drawing any labeled system of nodes and edges/arrows between nodes, whether or not this is to be interpreted as a commutative diagram. (It also allows drawing arrows which start or end at other arrows, rather than at nodes).

It has various features to control and adjust these diagrams to be visually pleasing, by changing sizing/spacing/curviness/arrow style/etc of the elements within these diagrams. This is all much more convenient in its WYSIWYG interface than manually planning and coding these figures in LaTeX, as had previously been the standard way to create them for mathematical papers.

Chinjut··on Quiver: A Modern Commutative Diagram Editor
A commutative diagram is just a collection of nodes and directed edges between nodes (aka, a directed graph), but it's a directed graph along with the claim that any two paths in this graph which start at the same node and end at the same node are to be considered equivalent, in some sense.

In general, a directed (multi)graph along with an account of which of its paths are and are not to be considered equivalent to each other (where this equivalence relation satisfies some basic nice properties) is known as a "category". This concept comes up ubiquitously in math/abstract logic/etc. Commutative diagrams are useful for quickly visually reasoning about equivalences of paths in such contexts.

Chinjut··on The number pi has an evil twin
The c value you compute depends on computing the b value, though. It's not a recursion carried out in a way which avoids square roots. It's just carrying out the same AM-GM sequence computation, and then taking a certain weighted harmonic mean over that sequence, which converges just because that original sequence converges anyway.

Note that the arithmetic-harmonic mean I think you were going for is just the geometric mean (not the arithmetic-geometric mean, just the geometric mean simpliciter; see https://mathworld.wolfram.com/Arithmetic-HarmonicMean.html).

Chinjut··on UnitedHealthcare CEO Brian Thompson Fatally Shot in Manhattan
Why has this been flagged?
Chinjut··on Question Sets and All Paths
The number of paths is the sum of 2^(y - x) over each pair (x, y) such that the x-th terminating question is the y-th question overall, plus 2^(number of non-terminating questions overall).

In other words, for each possible termination point (including making it all the way through), consider how many non-terminating questions come before that termination point, raise 2 to that power, and then sum these all up.

Thus, len(question_paths(totq, term)) is equal to sum([2**(term[i] - i) for i in range(len(term))]) + 2**(totq - len(term)).

Chinjut··on Alonzo Church: Architect of computer intelligence
It's not clear that this oft-repeated story of the origin of Alonzo Church's lambda notation is true. See https://en.wikipedia.org/wiki/Lambda_calculus#Origin_of_the_... for other instances where Alonzo Church has suggested it was more of an arbitrary choice of Greek letter.
Chinjut··on Alonzo Church: Architect of computer intelligence
"Lisp usually prefers expressive names". In addition to the exception of "lambda", there are also "car" and "cdr", which, while not Greek, are hardly transparent.
Chinjut··on LLMs, Theory of Mind, and Cheryl's Birthday
Hm, actually, it's confusing, because clicking the [>_] links where it mentions running code gives different code than it just mentioned.
Chinjut··on LLMs, Theory of Mind, and Cheryl's Birthday
Did you actually run the "fixed" code here? Its output is an empty list, just like the pre-"fixed" code.
Chinjut··on How does cosine similarity work?
That is the same thing as what is being said in the comment you are replying "No" to.
Chinjut··on On the cruelty of really teaching computing science (1988)
There is an extremely elegant solution to this modified question as well. In fact, it is always possible to fill a chessboard with dominoes with two squares of opposite color removed, by a very straightforward method (Gomory's Theorem). See Problem 2 at https://www.cut-the-knot.org/do_you_know/chessboard.shtml and note that the result generalizes to any bipartite Hamiltonian graph, such as any rectangular grid with an even number of cells.

(Much more generally, Hall's marriage theorem characterizes which finite bipartite graphs have a perfect matching, and there are polynomial-time algorithms to compute maximum cardinality matchings in arbitrary finite graphs.)

Chinjut··on From Sets to Categories (2023)
In particular, you seem fond of the application of Lagrange's theorem to deriving facts about prime numbers.

Presumably, what you have in mind here is the proof of Fermat's little theorem by saying "The integers modulo prime p under multiplication form a monoid of size p, among which the invertible subgroup comprises precisely the values not equivalent to zero (thus, of size p - 1). Within these, the order e of any value x is equivalent to the size of the subgroup x generates, which by Lagrange's theorem (decomposing the entire group into its cosets; i.e., its isomorphic orbits under the subgroup acting freely upon it) must divide the size of the overall group. Thus, x^(p - 1) = 1 mod p".

Yes, you can say all that in group-theoretic language. But someone skeptical of the value of group theory might object "All you are doing is using fancy words to say what could be said more straightforwardly. After all, Fermat's little theorem was understood by Fermat and others two hundred years before group theory was invented. Euler published his generalization of Fermat's little theorem a hundred years before group theory was invented. All your fancy-schmancy group theory is just pointlessly obfuscatory language for describing something already well understood".

And indeed, all group theory is doing in this case is showing us how to relate this one particular result to many other similar results. But that is the value of abstraction and generalization. That is how math often works. Recognizing a common pattern that comes up repeatedly, making particular instances obvious in retrospect, through fluently understanding their shared connection, once and for all. That's how it worked for groups, and that's the same way it works for categories.

← PreviousPage 6 of 32Next →