Hacker News

Top stories

Live mirror
30 storiesupdated just nowView source snapshot
  1. Cloudflare Quick Tunnels(cloudflare.com ↗)
    52comments
  2. An Empirical Study of Harness Design for Coding Agents(arxiv.org ↗)
    26comments
  3. North Korean nuclear test sets off years of earthquakes(science.org ↗)
    30comments
  4. OpenJev(openjev.com ↗)
    193comments
  5. Show HN: Rickub – The Smartest Git in the Universe(rickub.com ↗)
    4comments
  6. I don't like passkeys(hawksley.dev ↗)
    408comments
  7. Mathematicians Build Long-Awaited Graph Sandwich(quantamagazine.org ↗)
    discuss
  8. The Shadows Lurking in the Equations – Underwater Islands(gods.art ↗)
    8comments
  9. NATS publishes preliminary report on technical incident of 8 September(nats.aero ↗)
    13comments
  10. Bend 2 and the Vibe-Coding Trap(liampwll.com ↗)
    199comments
  11. GrassLobster: AI Agentic Generation of Parametric Geometry Workflows(miro.vision ↗)
    discuss
  12. Jemalloc 5.4.0(github.com/jemalloc ↗)
    67comments
  13. The scourge of x86 emulation(fex-emu.com ↗)
    63comments
  14. Cekura (YC F24) Is Hiring(ycombinator.com ↗)
    discuss
  15. Build Faster Feedback Loops Using Qualitative User Research(nseldeib.com ↗)
    discuss
  16. Warren Buffett Steps Down as Berkshire Chairman, Names Son to Replace Him(nytimes.com ↗)
    129comments
  17. Bonsai 2 27B: Near-Lossless Compression in a 9x Smaller Footprint(prismml.com ↗)
    172comments
  18. ZCode, the GLM coding agent, silently uploads your Git history(tokenstead.ai ↗)
    53comments
  19. Bend – A language that blocks AI mistakes via proof, on CPU and GPU(bend-lang.com ↗)
    287comments
  20. Qwen 3.8 Omni Flash(qwen.ai ↗)
    106comments
  21. Microsoft exec called AI scraping 'the largest theft of labor in human history'(techcrunch.com ↗)
    567comments
  22. BeanShell3 in Development(beanshell.github.io ↗)
    7comments
  23. Second Circuit Allows Government to Search Electronic Devices at the Border(knightcolumbia.org ↗)
    28comments
  24. How to Write with an LLM(sockpuppet.org ↗)
    175comments
  25. When the fractional part of a float fixes your shader(crocidb.com ↗)
    16comments
  26. Pre-Greek: The lost language hidden within Ancient Greek(linguisticdiscovery.com ↗)
    57comments
  27. AI is an elite crime spree(thebignewsletter.com ↗)
    1comments
  28. US Treasuries Have Become Unappetizing for Foreign Central Banks and Governments(wolfstreet.com ↗)
    1comments
  29. HEIF Heist: image parser RCE exploit(heif-heist.com ↗)
    2comments
  30. Replacing Pull Requests with Delta(zed.dev ↗)
    60comments

Ask HN: How long do you take to digest a Hard Programming Text?

6 pointsby 15y ago
5 comments
This question probably isn't the most useful, but it's always been a curiosity of mine. A recent look at Rick Hickey's Clojure bookshelf (http://www.amazon.com/Clojure-Bookshelf/lm/R3LG3ZBZS4GCTH/ref=cm_lm_byauthor_title_full) while trying to decide which book to tackle next prompted this question.

First, some definitions.

By digest, I mean to internalise all the core concepts of the text. I'm not just talking about practical implementation here; one recent personal example was the implementation of Hume and Sunday's Tuned-Boyer-Moore algorithm. I could express the algorithm pretty easily, but never knew what "unrolling the inner loop" meant until exploring and staring at various sources for a month. That represented probably about 30 hours of total time, something which, on the surface, seems like a horrendous waste of time (I learnt a lot while researching that of course - but it doesn't feel like it.).

By Hard Programming Text, I mean any document (book/paper/etc) which requires that you understand a completely new paradigm, or that changes substantially the quantity of your knowledge. So for example, a book like "Lisp in Small Pieces", which taught me the concept of Continuations, was considerably hard on the conceptual side. This also took at least a month of conscious connecting the dots between what was in the text, tail-recursion, and those funny callback functions I've been writing in nodejs, before i "Got it".

Naturally, that process is a little draining, but brings with it it's rewards. Still, what immediately follows is the reflective stage, when which I question whether I'm wasting my time, bringing to mind the images of first-hand experiences with people who just seem to internalise novel concepts like a sponge.

Anyway, TL;DR - understanding a programming text is really difficult, how long does it take you to internalise the concepts in that text, and what do you do to speed it up (if possible)?

15y agoHN ↗

It's been 10 years since SICP was assigned to me for a class, and I still find that it has previously-undiscovered truths waiting for me every time I open it up.

15y agoHN ↗

I should probably take a second run through that classic now. =P

15y agoHN ↗

I find it takes about 3 weeks if I start reading the text with a real-world use in mind. A week into it I'll try to write something towards that real-world goal and it will be horribly broken, but it will force me to really research what I'm not understanding as I'm going through the book instead of going back to re-read it 2 months later when I'm trying to use the new language/technique/etc.

15y agoHN ↗

I suspect you're going to get very different answers depending on what people consider "hard".

Continuations took me months, as did monads and typeclasses. Largely because there were preconceptions about programming that I had to unlearn before I could learn them. Continuations essentially require that you descend to a level of abstraction below structured programming and think "what is the computer actually doing", and then re-ascend the abstraction ladder with a new way to structure that. Monads require that you understand typeclasses, and typeclasses require that you think in terms of sets of types and the relations that govern them; it's not enough to import familiar OOP concepts.

A bunch of papers use such obtuse mathematical language that I couldn't hope to understand them without a grad degree in math.

OTOH, reading something like Lisp in Small Pieces (or even SICP) now is considerably easier, because I'm familiar with the basic concepts.

15y agoHN ↗

Thanks for the feedback. What you've said is true, and I should have included a clause asking what the answerer's background was.

Personally, I started out programming with Lisp, and hence got introduced to the functional style early on. So that was 2 years spent with Lambda's, and a year with laziness, type classes and purity (Haskell) before being introduced to Continuations.