pcael
Re:A gangster is running for president of Brazil has a bunker for coun...
on Friday October 23, 2026 @02:10PM (#50213130)
You can help preventing this guy from winning the most important election in Brazils history. Join the action group now: https://whatsapp.com/channel/0029VbCbRfD7tkj88k3soZ0Y
Brazils democracy is in dangerous.
Re:Connections in Math: the two kinds of random
on Tuesday July 07, 2026 @03:56PM (#48822894)
thanks, dont they have a reference book? thanks
Re:Connections in Math: the two kinds of random
on Tuesday July 07, 2026 @08:16AM (#48816686)
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 infinite strings. In that sense you cant compress all strings and pointing a specific one without representing the index to it with a complexity a least as large as the string itself it represents. Read the part of pointing and telling things apart.
Re:Deriving SVD without even aiming at it
on Monday July 06, 2026 @08:27PM (#48812248)
Lol, its funny how people think they know about others peoples lives... and speaking of wasting time...
Re:Connections in Math: the two kinds of random
on Monday July 06, 2026 @01:34PM (#48807896)
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!
Re:Deriving SVD without even aiming at it
on Sunday July 05, 2026 @10:12PM (#48799963)
Let me give you an idea, just dont read it then. Im not monetizing anything btw.
Re:Deriving SVD without even aiming at it
on Sunday July 05, 2026 @09:10PM (#48799648)
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.
Re:Deriving SVD without even aiming at it
on Sunday July 05, 2026 @09:08PM (#48799639)
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.
Re:Deriving SVD without even aiming at it
on Sunday July 05, 2026 @08:56PM (#48799568)
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 helps me as English is not my first language.
Re:Connections in Math: the two kinds of random
on Sunday July 05, 2026 @08:34PM (#48799438)
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 large as your representation of pi.
Re:Connections in Math: the two kinds of random
on Sunday July 05, 2026 @08:14PM (#48799314)
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 including the size of the reader. You fix one interpreter, then ask "how long is the shortest input that makes something?" The interpreter is a constant — the same constant for π, for the random file, for every string in the post
Re:Connections in Math: the two kinds of random
on Sunday July 05, 2026 @08:07PM (#48799279)
thats interesting, and maybe beyong 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.
Connections in Math: the two kinds of random
Deriving SVD without even aiming at it
New light-powered chip could accelerate AI and quantum computing
Re:Ask HN: Which IDE integrates AI best for programming (not vibe codi...
on Wednesday June 03, 2026 @11:29AM (#48385409)
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 change. Thats one way.
Re:Ask HN: Which IDE integrates AI best for programming (not vibe codi...
on Wednesday June 03, 2026 @09:23AM (#48383682)
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, and the interaction with agents has a different priority.
Re:You won't be talking to AI in natural language for too long
on Wednesday June 03, 2026 @06:43AM (#48382255)
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 quite dense english that sometimes I could not easily understand, but seems to make the coding agent pretty efficient in understanding the requirements.
The shared recipe behind search: Images, Shazam and RAG
Pynear 2.3 Is Out
• cosine indices (exact + approximate) • drop-in for scikit-learn (metric='cosine') • Incredibly fast approximate IndexBinaryMultiHash with high recall (beats Faiss in some contexts) pip install -U pynearhttps://github.com/pablocael/pynear
Re:Neovim 0.12.0
on Monday March 30, 2026 @07:30AM (#47572943)
What do you use for managing several different projects in nvim?
Show HN: PyNear – exact and approximate KNN, faster than Faiss
PyNear is a Python KNN library built around Vantage-Point Trees with a C++ SIMD core. I've been working on it for a while and just shipped v2.2 with two new approximate binary indices. Benchmarks surprised me so I wanted to share. * Where it beats Faiss: - Exact L2 search — VP-Trees prune aggressively using the triangle inequality. At d=512, N=500k: 2.2 ms vs Faiss IndexFlatL2's 85 ms...
Re:Ask HN: What's the latest concensus on OpenAI vs. Anthropic $20/mon...
on Sunday March 29, 2026 @04:36AM (#47561394)
Yes I meant Claude Code client.
Indeed Opus is a token eater, I usually use Sonnet because or that.
Re:Ask HN: What's the latest concensus on OpenAI vs. Anthropic $20/mon...
on Saturday March 28, 2026 @09:24PM (#47559625)
Have you tried Claude console client?