HackerTrans
TopNewTrendsCommentsPastAskShowJobs

osmarks

no profile record

Submissions

[untitled]

1 points·by osmarks·letztes Jahr·0 comments

[untitled]

1 points·by osmarks·vor 2 Jahren·0 comments

Counterintuitive Probabilities: Typical Sets from Information Theory

web.archive.org
2 points·by osmarks·vor 2 Jahren·0 comments

[untitled]

1 points·by osmarks·vor 2 Jahren·0 comments

Meme Search Engine

github.com
3 points·by osmarks·vor 2 Jahren·0 comments

comments

osmarks
·letztes Jahr·discuss
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.
osmarks
·letztes Jahr·discuss
This is sort of true currently, but extrapolate the trend.
osmarks
·letztes Jahr·discuss
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 myself directly. For code I do not care much so long as it works.
osmarks
·letztes Jahr·discuss
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 it can never replace them because [various things].
osmarks
·letztes Jahr·discuss
https://arxiv.org/abs/2212.10496
osmarks
·letztes Jahr·discuss
Common Crawl is petabytes. Anna's Archive is about a petabyte, but it includes PDFs with images.
osmarks
·letztes Jahr·discuss
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 might ever want to search would run to petabytes).

(the reasonable way is embedding search, which runs much faster with some precomputation, but you still have to store things)
osmarks
·letztes Jahr·discuss
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_%....
osmarks
·vor 2 Jahren·discuss
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/my-deep-learning-rig/ and https://www.mov-axbx.com/wopr/wopr_concept.html.
osmarks
·vor 2 Jahren·discuss
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 optimistically ICMP.
osmarks
·vor 2 Jahren·discuss
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 this though real interpreters do.
osmarks
·vor 2 Jahren·discuss
Yes. C is not Turing-complete even in theory. Other languages are. It doesn't especially matter.
osmarks
·vor 2 Jahren·discuss
You can't implement a Python interpreter with access to infinite memory in C as specified. That is the point.
osmarks
·vor 2 Jahren·discuss
CommonMark mostly fixes this.
osmarks
·vor 2 Jahren·discuss
Preserving the semantic content is helpful if you think you might want to switch the rendering later.
osmarks
·vor 2 Jahren·discuss
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/index.js
osmarks
·vor 2 Jahren·discuss
Python-the-language can be Turing-complete even if Python-as-actually-implemented is not.
osmarks
·vor 2 Jahren·discuss
C is indeed not Turing-complete for more or less this reason.
osmarks
·vor 2 Jahren·discuss
Crowdstrike should have higher testing standards, not every random back-office process.
osmarks
·vor 2 Jahren·discuss
> 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 "evolutionary algorithms" seemed to be based on an old school conception of evolution.

I think a lot of the genetic algorithms people do implement recombination-like things. Most of the things operated on aren't really structured like genomes so it makes less sense there.

> But intelligence like you or I's operates in an unconstrained problem space. I don't think you can apply gradient descent because, how the heck could you possibly score a behavior?

> This is where evolution excels as an algorithm. It can take an infinite problem space and consistently come up with "valid" solutions to it.

Evolutionary search also relies on scoring. Genetic algorithms on computers hardcode a "fitness function" to determine what solutions are good and should be propagated and biological evolutionary processes are implicitly selecting on "inclusive genetic fitness" or something. You can't apply gradient-based optimizers directly to all of these, though, because they are not (guaranteed to be) differentiable. There are lots of ways to optimize against nondifferentiable functions in smarter ways than evolutionary search, and these come under "reinforcement learning", which does work but is generally more annoying than (self-)supervised algorithms.

> I think Darwin Machines might be able to explain "animal intelligence". But human intelligence is a whole other deal. There's some incredible research on it that is (as far as I can tell) largely undiscovered by AI engineers that I can share if you're interested.

As far as I know human brains are more or less a straight scaleup of smaller primate brains.