What is Hackers' Pub?

Hackers' Pub is a place for software engineers to share their knowledge and experience with each other. It's also an ActivityPub-enabled social network, so you can follow your favorite hackers in the fediverse and get their latest posts in your feed.

安くない??

月間 約790,000件(令和5年4月1日から令和6年3月31日までの月間平均)
(補足)トップページのみのアクセス件数(ページビュー単位)です。また、これは参考値であり、毎月のアクセス件数を保証するものではありません。
1枠当たり 5,000円(税込み)
www.city.saitama.lg.jp/005/002/006/001/p009747.html

0

A formal proof of complexity bounds on diophantine equations. ~ Jonas Bayer, Marco David. arxiv.org/abs/2505.16963

arXiv logo

A Formal Proof of Complexity Bounds on Diophantine Equations

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed that there is no general algorithm to decide whether an arbitrary Diophantine equation has a solution. However, the problem remains open when generalized to the field of rational numbers, or contrarily, when restricted to Diophantine equations with bounded complexity, characterized by the number of variables $ν$ and the degree $δ$. If every Diophantine set can be represented within the bounds $(ν, δ)$, we say that this pair is universal, and it follows that the corresponding class of equations is undecidable. In a separate mathematics article, we have determined the first non-trivial universal pair for the case of integer unknowns. In this paper, we contribute a formal verification of the main construction required to establish said universal pair. In doing so, we markedly extend the Isabelle AFP entry on multivariate polynomials, formalize parts of a number theory textbook, and develop classical theory on Diophantine equations in Isabelle. Additionally, our work includes metaprogramming infrastructure designed to efficiently handle complex definitions of multivariate polynomials. Our mathematical draft has been formalized while the mathematical research was ongoing, and benefitted largely from the help of the theorem prover. We reflect how the close collaboration between mathematician and computer is an uncommon but promising modus operandi.

arxiv.org · arXiv.org

0
0
0
1
0
0
0
1
0
17
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0

Echoing what @anildash said here. Truly an end of an era.

me.dm/@anildash/11455288010404

I've been a huge fan of Glitch before it was called Glitch. I've hosted dozens of apps, which have been turned into remixes by the community, covered by the Verge, won a Glitch app of year award, I wrote tutorials using Glitch, got interviewed for their blog, I could go on.

But I might just save that for a separate blog post. Until then, wishing Anil and the rest of the team all the best!

0
0
0
0
0
0
0
0
0

Today, the world lost Sebastião Salgado — a giant in the world of photography and one of the most profound visual storytellers of our time.

His work showed us the dignity of labor, the harsh beauty of migration, and the fragile splendor of our planet. As a street photographer myself, I’ve often looked to his images not only for inspiration but as a reminder of why we press the shutter: to witness, to care, and to remember.

Obrigado, mestre Salgado. Your light will never fade.


0

🆕 Pushed by noridev with 1 commit:
?[7b82661] enhance(frontend): (Friendly) 스크롤 시 요소 표시 기능에 의해 숨기도록 설정하지 않은 요소는 스크롤하면 반투명하게 표시되도록 변경됨

0
0
0
0

어느 오디오 커뮤니티 사이트에 저번에 중고로 산 TEAC SL-D950의 노이즈 문제를 물어봤는데 밖에 나온 금속 부분에 손 댔을 때 노이즈가 사라지지 않으면 접지 문제가 아니라고 했었음
그것만 알려주고 그 뒤로는 답이 없어서 해결 방법은 모르지만 일단 접지 문제가 아니라는 건 알게 됨
그러면 수리업체에 들고가서 뜯어야하나...

0