Viewing profile — justinpombrio
justinpombrio
HN member- Joined
- Sat, Mar 26, 2011, 11:01 PM UTC
- HN karma
- 4,643
- Public activity
- 962 items
- HN profile
- View on Hacker News ↗
About justinpombrio
Recent public activity
-
comment
Comment #48867238
There's no such thing as an undecidable statement. A single statement can't be undecidable. Undecidability is a property of a class of statements. For example, you can ask whether …
-
comment
Comment #48840212
> That's average or mean. Median is the middle value. The median of an even number of values is typically defined to be the mean of the two middle-most values.
- comment
-
comment
Comment #48262589
> it might be a week before i get back to it, and the name of the branch is a clue as to what the heck I was doing. Ah, this is what the description (what git would call the commit…
-
comment
Comment #48088195
Parsing is usually implemented in two steps: first there's lexing where the input is turned into a sequence of tokens, then there's proper parsing where the sequence of tokens is t…
-
comment
Comment #48085970
Yeah, it's a parsing algorithm for parsing infix (etc.) expressions. If you've seen a parsing library refer to "precedence climbing" or "operator precedence parsing", it's doing th…
-
comment
Comment #48085933
It treated that as 1 0 0 + 8 8 / 4 which is nonsensical, but it has no error detection so it rolled with it. Really `100` should be its own token, but there's no way to input that.…
-
comment
Comment #47713816
Honestly I've had more technical problems installing Windows than Linux Mint recently, not to mention the multiple hours spent hunting down and disabling all of the telemetry and a…
-
comment
Comment #47301454
This is a terrible source of information: it's talking about a survey about vision problems, by an eye care company, and you can't see the survey. I'm completely sure that the way …
- comment
-
comment
Comment #45521153
Could you name one that seems likely to fail?
-
comment
Comment #45341848
I was going to say that that's not a CRDT because it requires a centralized server (the conflict resolution is "order in which the server received the messages", and clients aren't…
-
comment
Comment #45160823
Rust's traits _do_ solve the expression problem. Each data type is a `struct`. Each operation is a trait. You `impl` each trait on each struct. This works even if you're using a li…
-
comment
Comment #43408421
> (not an actual dictionary) Urban Dictionary The definition of dictionary is just "Words about words" (source: Urban Dictionary), so I'd say that Urban Dictionary qualifies.
-
comment
Comment #43207839
> by assuming that a system that can be formally modeled can prove something that cannot be proven within a formal system Something that cannot be proven within which formal system…
-
comment
Comment #43207781
Oof, I pattern matched OP to a different argument I've seen a lot. That's embarrassing. Yes, that's correct, it's provably impossible to construct an LLM that, if you ask it "Will …
-
comment
Comment #43201797
Gödel's Incompleteness Theorem places a limit on what you can prove within a formal system . Neither humans nor LLMs are a formal system, so it says nothing about them. Someone's g…
-
comment
Comment #43167226
Can you give a reference to your teaching materials? The way this sort works is bizarre enough that I'm curious what you said about it. (Also to verify that this is actually the al…
-
comment
Comment #43166817
Yeah, 2410 vs. 2509 swaps not including the first iteration. You should try measuring these things yourself, I'm not sure if it's doing what you think it's doing.
-
comment
Comment #43165797
> Why is there any difference? Does the entire difference come from the iteration where i = 1? Sometimes it's more swaps, and sometimes it's less. The vague pattern looks like Can'…
-
comment
Comment #43165557
The number of swaps is nearly the same between Bubble Sort and Can't Believe Sort. For a random list with 100 elements, it's 2505 swaps vs. 2513 swaps. The number of comparisons is…
-
comment
Comment #43162858
I did search for "trivial sorting network", but the only networks that were called trivial were the ones for exactly two elements, while this algorithm sorts an arbitrary number of…
-
comment
Comment #43117999
The paper: https://arxiv.org/abs/2410.20392
-
comment
Comment #43022442
Yup, that's all correct. I drew `squash` and `backout` in terms of files in order to avoid needing notation for the opposite of an edit and the composition of two edits.
- comment