pcael

5 ms·

1.
by pcael 2mo ago
thanks, dont they have a reference book? thanks
2.
by pcael 2mo ago
Of course you can. Kolmogorov complexity never says anything about finding lower bounds for specific elements. The lower bound is a statament about one string. The upper bound is statement about infinite strings, so you need to prove for in
3.
by pcael 2mo ago
Lol, its funny how people think they know about others peoples lives... and speaking of wasting time...
4.
by pcael 2mo ago
Thats really interesting.. Do you recommend any books on ergodic theory that are accessible? I have undergrad in math, but it was a while ago. Thanks!
5.
by pcael 2mo ago
Let me give you an idea, just dont read it then. Im not monetizing anything btw.
6.
by pcael 2mo ago
Im fully aware. But since you came here to criticize only, thanks. Its one of the simple forms of lossy compression, so you could have just point out that constructively, but hey this is internet.
7.
by pcael 2mo ago
Except anyone can use bullets. And except the section title is basically me resuming what was seeing before: Taking stock: what we managed to extract So you want me to use what? Give me a break.
8.
by pcael 2mo ago
Im not trying anything. I just put as a joke. Im using AI to learn, but I wrote the structure and the references, and remodeled some parts with AI, yes, but I wrote the base input text by hand, in the sense AI would not be needed, but it he
9.
by pcael 2mo ago
Does that solve the issue? You can always ask yourself if you can embedd something smaller or not? Kolmogorov is just comparing things.. plus, in order to specifically point to pi in the languages internal table, you will need complexity as
10.
by pcael 2mo ago
I think that does not hold, Kolmogorov complexity is measured relative to a pre-defined universal machine for everything. The machine is not counted in the description of π, for the same reason a book's length isn't measured by in
11.
by pcael 2mo ago
thats interesting, and maybe beyond my current knowledge, I will certainly look into it. About the entropy being a property of a distribution, thats totally correct and I need to fix the post. Thanks.
12.
Connections in Math: the two kinds of random(stillthinking.net)
48 points by pcael 2mo ago|38 comments
13.
Deriving the SVD (Single Value Decomposition) from scratch(stillthinking.net)
35 points by pcael 3mo ago|18 comments
14.
New light-powered chip could accelerate AI and quantum computing(sciencedaily.com)
3 points by pcael 3mo ago|0 comments
15.
by pcael 4mo ago
I mean if you are using version control like git you can always see diffs. I would say it might be easier to go that way into checking small changes into commits and dev branches, then you can try a very good diff UI that will refresh each
16.
by pcael 4mo ago
why would you use an IDE if you are not the one coding? You can review the code in github/gitlab using prs, but not necessarily code.. I feel IDEs are not the best environment for coding agents UI because the prioritize code editing, a
17.
by pcael 4mo ago
Thats very interesting view. I actually had some experience with that kind of dense language for specifying when I start testing using two llms to code: one to instruct the coding agent and the agent itself. The instructor start creating qu
18.
The shared recipe behind search: Images, Shazam and RAG(medium.com)
2 points by pcael 4mo ago|0 comments
19.
Pynear 2.3 Is Out
3 points by pcael 4mo ago|0 comments
20.
by pcael 6mo ago
What do you use for managing several different projects in nvim?
21.
Show HN: PyNear – exact and approximate KNN, faster than Faiss
2 points by pcael 6mo ago|0 comments
22.
by pcael 6mo ago
Yes I meant Claude Code client. Indeed Opus is a token eater, I usually use Sonnet because or that.
23.
by pcael 6mo ago
Have you tried Claude console client?
24.
PyNear: Exact KNN 39× faster than Faiss at d=512, approximate binary 257× faster(github.com)
2 points by pcael 6mo ago|0 comments