Viewing profile — osmarks
osmarks
HN member- Joined
- Tue, Apr 10, 2018, 9:33 PM UTC
- HN karma
- 231
- Public activity
- 134 items
- HN profile
- View on Hacker News ↗
About osmarks
No profile information was provided.
Recent public activity
-
comment
Comment #44261641
I was briefly looking into using SMT for Minecraft autocrafting, but it turns out you can do integer linear programming and the mapping is easier.
-
comment
Comment #43810376
This is sort of true currently, but extrapolate the trend.
-
comment
Comment #43807038
Also, I don't use ChatGPT to rewrite blog posts and don't like people who do. Its style is annoying and if ChatGPT is doing content I might as well ask it whatever you asked it mys…
-
comment
Comment #43807011
Artists correctly realized the threat to their future economic viability and made up reasons it was morally bad. Programmers are currently stuck in an earlier stage, insistent that…
-
comment
Comment #43455579
https://arxiv.org/abs/2212.10496
-
comment
Comment #43451975
Common Crawl is petabytes. Anna's Archive is about a petabyte, but it includes PDFs with images.
-
comment
Comment #43451680
You could just run a local LLM over every document and ask it "is this related to this query". I don't think you actually want to wait a week (and holding all the documents you mig…
-
comment
Comment #43318245
There is at least one organization doing actual embedding-based search (Exa). I wrote about this a bit: https://docs.osmarks.net/hypha/osmarks.net_web_search_plan_%... .
- story
-
comment
Comment #42501697
Most of these are just an EPYC server platform, some cursed risers and multiple PSUs (though cryptominer server PSU adapters are probably better). See https://nonint.com/2022/05/30…
- story
-
comment
Comment #41487540
They couldn't have built it on anything but UDP because the world is now filled with poorly designed firewall/NAT middleboxes which will not route things other than TCP, UDP and op…
-
comment
Comment #41131286
The C specification limits programs to addressing a finite amount of memory, though it can be made arbitrarily large by an implementation. The Python specifications do not imply th…
-
comment
Comment #41123021
Yes. C is not Turing-complete even in theory. Other languages are. It doesn't especially matter.
-
comment
Comment #41123007
You can't implement a Python interpreter with access to infinite memory in C as specified. That is the point.
-
comment
Comment #41121378
CommonMark mostly fixes this.
-
comment
Comment #41121360
Preserving the semantic content is helpful if you think you might want to switch the rendering later.
-
comment
Comment #41121349
I solve this for my usecases with custom Markdown rendering which accepts a few new block elements (via a markdown-it plugin). https://github.com/osmarks/website/blob/master/src/in…
-
comment
Comment #41121178
Python-the-language can be Turing-complete even if Python-as-actually-implemented is not.
-
comment
Comment #41121166
C is indeed not Turing-complete for more or less this reason.
-
comment
Comment #41005517
Crowdstrike should have higher testing standards, not every random back-office process.
-
comment
Comment #41003704
> When I first read about Darwin Machines, I looked up "evolutionary algorithms in AI", thought to myself "Oh hell ya, these CS folks are on it" and then was shocked to learn that …
-
comment
Comment #40988902
> A Darwin Machine uses evolution to produce intelligence. It relies on the same insight that produced biology: That evolution is the best algorithm for predicting valid "solutions…
-
comment
Comment #40988282
I don't think this is true as stated. Evolutionary algorithms are not the most efficient way to do most things because they, handwavily, search randomly in all directions. Gradient…
-
comment
Comment #40725491
Mistral and Meta release "instruct" (RLHF) and not-instruct models. The non-instruct ones are in fact non-RLHF, pretraining-only ones (though they probably have ChatGPT-ish text in…