tomstuart

Among a strong field, this is the single most depressing comment I’ve ever read on Hacker News. Several grim components but it’s the “I don’t understand why” which seals the deal.

The game’s difficult to understand so it’s too punitive to not offer even a single practice/example puzzle to use for learning. One puzzle a day is nice once you’ve got the hang of it, but it’s discouraging to “waste” today’s puzzle on learning the rules and not be able to try for real until tomorrow.

I had to look this up: https://doi.org/10.7155/jgaa.00370

Congratulations on the new adventure, Steve, and good luck!

What do you mean by “Pagemorphs”? A quick Google search suggests you’re the only person using this term so it’s hard to know what you’re recommending. I think it must mean e.g. https://turbo.hotwired.dev/handbook/page_refreshes?

Do you want another person (or yourself in the future) to be able to read your commits, in order, to get a clear account of what changed & why? If so, you should fix up those commits to address mistakes. If not, it doesn’t matter.

https://www.hyrumslaw.com/

Yes, it is.

This sounds intuitively true, but it’s a (very persistent) myth: https://www.viget.com/articles/just-use-double-quoted-ruby-s...

The branding is incredibly confusing, but: Hotwire (https://hotwired.dev/) is a set of ideas about how to build dynamic web UI (“HTML over the wire”), and the Turbo, Stimulus and Native frameworks are complementary implementations of those ideas in JavaScript and native mobile code. You can use all, some or none of them to build a Hotwire-style app.

The three frameworks originated in Rails apps, so they have good Rails integrations, but there’s nothing Rails-specific about them and you can use them in any environment where HTML is sent from server to client, even a static web site.

Rails’ nightly CI already needed a fix: https://github.com/rails/rails/pull/52937

Here’s the PR. I don’t know whether it was discussed elsewhere. https://github.com/ruby/rdoc/pull/1157

That’s the joke.

I’m pretty sure you’re talking to an LLM.

Definitive reference: https://www.urbanautomaton.com/blog/2015/08/10/the-pledge-to...

I did read your comment but I don’t really understand what you mean by “the memory system”. A linear bounded automaton is by definition a finite state machine for a given input (i.e. fixed tape size) because the number of possible configurations is finite. A Turing machine’s infinite tape is what stops it being a finite state machine.

Real-world computers are equivalent to linear bounded automata, not true Turing machines, because they have finite memory. This technicality is mostly ignored because a computer with a large finite memory is a decent enough approximation to a Turing machine for practical purposes. But, for example, the halting problem is decidable for linear bounded automata — because there are only finitely many states, every computation must either halt or eventually revisit an earlier state and get stuck in a loop — so in theory it’s an important distinction.

Mike Dalessio, the maintainer of Nokogiri, gave an excellent talk about this at Rails World 2023: https://youtu.be/USPLEASZ0Dc?t=939

You’re taking the use of the word “state” too literally. The original comment was complaining about how Ruby `require` adds names (constants) to a global namespace; Python `import` only binds names in the local scope.

You might be interested in Chris Salzberg’s Im [0], already usable on Ruby 3.2, or the discussion about the speculative “namespace on read” feature [1].

[0] https://github.com/shioyama/im

[1] https://bugs.ruby-lang.org/issues/19744

The target audience for this hack are people who carefully weigh their beans (and then put them into the empty hopper for grinding) each time they make coffee.

I wouldn’t defend the idea that it’s “clear”, but the idea is to build a machine that combines the axioms of ZF set theory in all possible ways to generate all possible conclusions, checking each one for contradiction as it goes. If it never generates a contradictory conclusion from those axioms, it’ll run forever.

It’s a student project, so the primary intent is to do the work necessary to graduate.

https://www.ycombinator.com/legal/#tou

Phew, thanks!

What is going on with this comment? It was clearly made a couple of days ago, and Simon’s reply was also posted a couple of days ago, and yet they’re both appearing on an article posted in the last day, and (on that post) showing as being a few hours old. Am I on glue?

This “podcast” is a radio show which was broadcast on July 2nd: https://www.abc.net.au/radionational/programs/futuretense/co...

There will be, yes: https://developer.apple.com/visionos/work-with-apple/

The peculiar viewpoint you’re demonstrating in this comment is similar to Reddit’s. It’s not objectively wrong, but the calculus involved definitely looks weird from the outside.

How would you quantify the value of Hacker News to Y Combinator? You’re talking about it like it’s a cost centre, a charitable contribution to society; what proportion of Y Combinator’s revenue can be attributed to the brand and content marketing benefits which flow from the (almost) entirely unpaid contributions of HN users? The Firebase API now costs “quite a bit”; is that amount comparable to the income of a YC partner? How much should a third-party developer be compensated for the work of building a native client which brings HN to a wider audience or increases the engagement of its existing audience? How much should an HN user be compensated for their submissions and comments? Which people deserve to make money here and why? Who is “indirectly funding” whom?

I don’t think you’re misunderstanding anything, but to clarify, I’m talking about a more general notion of subtyping (e.g. structural, “duck typing” etc), not necessarily inheritance. Instances of A and B can (in Smalltalk parlance) respond to the same set of messages, and therefore be substitutable for each other, without having any inheritance relationship. In that case there’s no coupling of implementation, only the flexibility of being able to swap out an A instance for a B instance without its collaborators being any the wiser.